43 search results - page 1 / 9 » Nash Equilibria for Voronoi Games on Transitive Graphs |
WINE
2009
Springer
14 years 3 months ago
2009
Springer
ESA
2007
Springer
14 years 5 months ago
2007
Springer
In this paper we study a game where every player is to choose a vertex (facility) in a given undirected graph. All vertices (customers) are then assigned to closest facilities and...
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
JGAA
2007
13 years 10 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. ...
ICASSP
2011
IEEE
13 years 2 months ago
2011
IEEE
Correlated equilibria are a generalization of Nash equilibria that permit agents to act in a correlated manner and can therefore, model learning in games. In this paper we define...