3504 search results - page 18 / 701 » Computational Aspects of Equilibria |
TAMC
2010
Springer
14 years 1 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
Lecture Notes
These are game theory notes from LSE. They cover the following topics: Nim and combinatorial games, Games as trees and in strategic form, Mixed strategy equilibria,
Game trees wit...
ECCC
2006
13 years 8 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
SAGT
2010
Springer
13 years 7 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
CIE
2010
Springer
14 years 1 months ago
2010
Springer
