1447 search results - page 6 / 290 » Graphs and Path Equilibria |
ESA
2007
Springer
14 years 3 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...
UAI
2004
13 years 11 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
MFCS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. We study the existence and tractability of a notion of approximate equilibria in bimatrix games, called well supported approximate Nash Equilibria (SuppNE in short). We p...
ATAL
2010
Springer
13 years 10 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
COCOA
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...