179 search results - page 20 / 36 » On Learning Algorithms for Nash Equilibria |
ICML
2008
IEEE
16 years 17 days ago
2008
IEEE
Quite a bit is known about minimizing different kinds of regret in experts problems, and how these regret types relate to types of equilibria in the multiagent setting of repeated...
SIGECOM
2010
ACM
14 years 12 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....
97
Voted
WINE
2005
Springer
15 years 5 months ago
2005
Springer
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are...
SIGECOM
2006
ACM
15 years 5 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...
SODA
2010
ACM
14 years 10 months ago
2010
ACM
We consider computational aspects of alternating move games, repeated games in which players take actions at alternating time steps rather than playing simultaneously. We show tha...