34 search results - page 6 / 7 » A Polynomial Time Algorithm for Finding Nash Equilibria in P... |
STOC
2003
ACM
14 years 6 months ago
2003
ACM
We introduce a simple network design game that models how independent selfish agents can build or maintain a large network. In our game every agent has a specific connectivity requ...
COCOA
2009
Springer
14 years 6 days 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...
ESA
2009
Springer
14 years 6 days 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...
BIRTHDAY
2009
Springer
14 years 13 days ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We present an experimental investigation of the performance of the Lemke-Howson algorithm, which is the most widely used algorithm for the computation of a Nash equilibrium for bi...