350 search results - page 15 / 70 » Approximation Algorithms for Unique Games |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
UAI
2001
13 years 9 months ago
2001
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equ...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
AAAI
2008
13 years 9 months ago
2008
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...