Sciweavers

176 search results - page 20 / 36
» Decision Problems for Nash Equilibria in Stochastic Games
Sort
View
ATAL
2004
Springer
14 years 12 days ago
Best-Response Multiagent Learning in Non-Stationary Environments
This paper investigates a relatively new direction in Multiagent Reinforcement Learning. Most multiagent learning techniques focus on Nash equilibria as elements of both the learn...
Michael Weinberg, Jeffrey S. Rosenschein
DSS
2000
113views more  DSS 2000»
13 years 6 months ago
Quality of service provision in noncooperative networks with diverse user requirements
This paper studies the quality of service (QoS) provision problem in noncooperative networks where applications or users are sel sh and routers implement generalized processor sha...
K. Park, M. Sitharam, S. Chen
ECAI
2006
Springer
13 years 10 months ago
Boolean Games Revisited
Abstract. Game theory is a widely used formal model for studying strategical interactions between agents. Boolean games [8] are two players, zero-sum static games where players...
Elise Bonzon, Marie-Christine Lagasquie-Schiex, J&...
ATAL
2008
Springer
13 years 9 months ago
Searching for approximate equilibria in empirical games
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
Patrick R. Jordan, Yevgeniy Vorobeychik, Michael P...
AAAI
2010
13 years 7 months ago
Algorithms for Finding Approximate Formations in Games
Many computational problems in game theory, such as finding Nash equilibria, are algorithmically hard to solve. This limitation forces analysts to limit attention to restricted su...
Patrick R. Jordan, Michael P. Wellman