206 search results - page 11 / 42 » Computing Equilibria in Anonymous Games |
69
Voted
TARK
2007
Springer
15 years 5 months ago
2007
Springer
AAAI
2007
15 years 2 months ago
2007
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
We suggest that extending Muller games with preference ordering for players is a natural way to reason about unbounded duration games. In this context, we look at the standard solu...
86
Voted
UAI
2004
15 years 1 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
CORR
2010
Springer
14 years 10 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...