65 search results - page 2 / 13 » The Complexity of Nash Equilibria in Infinite Multiplayer Ga... |
CSR
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we study turn-based quantitative multiplayer non zero-sum games played on finite graphs with reachability objectives. In this framework each player aims at reaching...
STACS
2007
Springer
13 years 10 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
SIGECOM
2006
ACM
13 years 10 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...