234 search results - page 20 / 47 » A polynomial-time nash equilibrium algorithm for repeated ga... |
105
click to vote
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We study a general sub-class of concave games, which we call socially concave games. We show that if each player follows any no-external regret minimization procedure then the dyn...
AAMAS
2007
Springer
14 years 10 months ago
2007
Springer
We consider a repeated Prisoner’s Dilemma game where two independent learning agents play against each other. We assume that the players can observe each others’ action but ar...
WINE
2010
Springer
14 years 7 months ago
2010
Springer
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibr...
103
click to vote
ATAL
2010
Springer
14 years 11 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...
TSP
2008
14 years 9 months ago
2008
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...