206 search results - page 6 / 42 » Computing Equilibria in Anonymous Games |
SIGECOM
2006
ACM
14 years 20 days 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...
ICPP
2007
IEEE
14 years 1 months ago
2007
IEEE
– Anonymous communication systems built on P2P infrastructures using anonymity forwarders are frequently affected by the churn problem, i.e. frequent joins and leaves of nodes. T...
SIGECOM
2003
ACM
13 years 12 months ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
SIGECOM
2010
ACM
13 years 11 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
CSJM
2006
13 years 6 months ago
2006
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...