144 search results - page 21 / 29 » Computing Nash Equilibria of Action-Graph Games |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
SIGECOM
2010
ACM
13 years 7 months ago
2010
ACM
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
AAAI
2006
13 years 8 months ago
2006
Significant work has been done on computational aspects of solving games under various solution concepts, such as Nash equilibrium, subgame perfect Nash equilibrium, correlated eq...
ESA
2009
Springer
14 years 2 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...