35 search results - page 3 / 7 » Computing pure strategy nash equilibria in compact symmetric... |
WINE
2010
Springer
13 years 4 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
CSE
2009
IEEE
13 years 10 months ago
2009
IEEE
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
CORR
2004
Springer
13 years 6 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
CSL
2009
Springer
14 years 22 days ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
SIGECOM
2006
ACM
14 years 3 days ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...