156 search results - page 8 / 32 » Homotopy Methods to Compute Equilibria in Game Theory |
114
click to vote
SAGT
2010
Springer
15 years 7 days ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
133
click to vote
TCS
2010
14 years 8 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
114
Voted
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...
104
click to vote
CORR
2010
Springer
15 years 12 days 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...
111
click to vote
ICALP
2007
Springer
15 years 8 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...