68 search results - page 10 / 14 » New Algorithms for Approximate Nash Equilibria in Bimatrix G... |
AAAI
2007
13 years 9 months ago
2007
In normal scenarios, computer scientists often consider the number of states in a game to capture the difficulty of learning an equilibrium. However, players do not see games in ...
ISAAC
2005
Springer
14 years 26 days ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...
COCOA
2009
Springer
14 years 1 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we introduce a novel flow representation for finite games in strategic form. This representation allows us to develop a canonical direct sum decomposition of an arbi...
SIGECOM
2005
ACM
14 years 28 days ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...