179 search results - page 21 / 36 » On Learning Algorithms for Nash Equilibria |
107
Voted
ESA
2009
Springer
15 years 8 months ago
2009
Springer
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
131
Voted
APPROX
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
129
Voted
WAOA
2010
Springer
14 years 11 months ago
2010
Springer
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
156
Voted
SIGECOM
2011
ACM
14 years 4 months ago
2011
ACM
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
100
click to vote
SAGT
2009
Springer
15 years 8 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...