224 search results - page 2 / 45 » On Nash-Equilibria of Approximation-Stable Games |
JUCS
2010
14 years 6 months ago
2010
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
UAI
2001
15 years 1 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...
97
Voted
JGAA
2007
14 years 11 months ago
2007
Abstract. Two-player win-lose games have a simple directed graph representation. Exploiting this, we develop graph theoretic techniques for finding Nash equilibria in such games. ...
102
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
109
click to vote
CORR
2008
Springer
14 years 11 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...