35 search results - page 2 / 7 » Computing pure strategy nash equilibria in compact symmetric... |
FOCS
2007
IEEE
13 years 11 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...
UAI
2004
13 years 6 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
JUCS
2010
13 years 4 days ago
2010
Abstract: We investigate the Weihrauch-degree of several solution concepts from noncooperative game theory. While the consideration of Nash equilibria forms the core of our work, a...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...