79 search results - page 7 / 16 » Deliberation in Equilibrium: Bargaining in Computationally C... |
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in simple stochastic multiplayer games. We show that restricting the search space to equilibria whose payoffs fal...
SIGECOM
2010
ACM
14 years 10 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
COCOON
2008
Springer
14 years 11 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
FOCS
2007
IEEE
15 years 4 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
ICS
2010
Tsinghua U.
15 years 1 months ago
2010
Tsinghua U.
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...