Sciweavers

176 search results - page 17 / 36
» Decision Problems for Nash Equilibria in Stochastic Games
Sort
View
SODA
2004
ACM
128views Algorithms» more  SODA 2004»
13 years 9 months ago
Computing equilibria for congestion games with (im)perfect information
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
René Beier, Artur Czumaj, Piotr Krysta, Ber...
ICALP
2005
Springer
14 years 1 months ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis
AAAI
2006
13 years 9 months ago
On the Difficulty of Achieving Equilibrium in Interactive POMDPs
We analyze the asymptotic behavior of agents engaged in an infinite horizon partially observable stochastic game as formalized by the interactive POMDP framework. We show that whe...
Prashant Doshi, Piotr J. Gmytrasiewicz
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
WICON
2008
13 years 9 months ago
Game-based admission control for wireless systems
Much previous work has examined the wireless power control problem using tools from game theory, an economic concept which describes the behavior of interdependent but non-coopera...
Benjamin Yolken, Nicholas Bambos