Sciweavers

65 search results - page 8 / 13
» The Complexity of Nash Equilibria in Infinite Multiplayer Ga...
Sort
View
WINE
2005
Springer
179views Economy» more  WINE 2005»
14 years 1 months ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 29 days ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
14 years 2 months ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
ANOR
2002
92views more  ANOR 2002»
13 years 7 months ago
Nash Equilibrium and Subgame Perfection in Observable Queues
A subgame perfection refinement of Nash equilibrium is suggested for games of the following type: each of an infinite number of identical players selects an action using his privat...
Refael Hassin, Moshe Haviv
ATAL
2008
Springer
13 years 9 months ago
Approximating mixed Nash equilibria using smooth fictitious play in simultaneous auctions
We investigate equilibrium strategies for bidding agents that participate in multiple, simultaneous second-price auctions with perfect substitutes. For this setting, previous rese...
Enrico H. Gerding, Zinovi Rabinovich, Andrew Byde,...