Sciweavers

176 search results - page 4 / 36
» Decision Problems for Nash Equilibria in Stochastic Games
Sort
View
EOR
2008
88views more  EOR 2008»
13 years 7 months ago
Selection of a correlated equilibrium in Markov stopping games
This paper deals with an extension of the concept of correlated strategies to Markov stopping games. The Nash equilibrium approach to solving nonzero-sum stopping games may give m...
David M. Ramsey, Krzysztof Szajowski
ICML
1998
IEEE
14 years 8 months ago
Multiagent Reinforcement Learning: Theoretical Framework and an Algorithm
In this paper, we adopt general-sum stochastic games as a framework for multiagent reinforcement learning. Our work extends previous work by Littman on zero-sum stochastic games t...
Junling Hu, Michael P. Wellman
SOFSEM
2009
Springer
14 years 4 months ago
-Hardness of Pure Nash Equilibrium in Scheduling and Connection Games
We prove NP-hardness of pure Nash equilibrium for some problems of scheduling games and connection games. The technique is standard: first, we construct a gadget without the desir...
Nguyen Kim Thang
TCS
2008
13 years 7 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
TCS
2010
13 years 6 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer