170 search results - page 11 / 34 » Parallel Computation of Nash Equilibria in N-Player Games |
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
SAGT
2009
Springer
14 years 2 months ago
2009
Springer
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we consider Nash Equilibria for the selfish routing model proposed in [12], where a set of n users with tasks of different size try to access m parallel l...