294 search results - page 10 / 59 » The complexity of computing a Nash equilibrium |
ECCC
2006
14 years 9 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
AAAI
2004
14 years 11 months ago
2004
We present two simple search methods for computing a sample Nash equilibrium in a normal-form game: one for 2player games and one for n-player games. We test these algorithms on m...
ATAL
2010
Springer
14 years 10 months ago
2010
Springer
There has been significant recent interest in game theoretic approaches to security, with much of the recent research focused on utilizing the leader-follower Stackelberg game mod...
104
click to vote
FORMATS
2010
Springer
14 years 7 months ago
2010
Springer
We study two-player timed games where the objectives of the two players are not opposite. We focus on the standard notion of Nash equilibrium and propose a series of transformation...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...