Sciweavers

1599 search results - page 157 / 320
» Algorithms for Parity Games
Sort
View
ATAL
2004
Springer
15 years 12 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
GECCO
2009
Springer
124views Optimization» more  GECCO 2009»
15 years 11 months ago
Reinforcement learning for games: failures and successes
We apply CMA-ES, an evolution strategy with covariance matrix adaptation, and TDL (Temporal Difference Learning) to reinforcement learning tasks. In both cases these algorithms se...
Wolfgang Konen, Thomas Bartz-Beielstein
CORR
2007
Springer
111views Education» more  CORR 2007»
15 years 6 months ago
A New Perspective on Multi-user Power Control Games in Interference Channels
This paper considers the problem of how to allocate power among competing users sharing a frequency-selective interference channel. We model the interaction between these selfish ...
Yi Su, Mihaela van der Schaar
CSL
2009
Springer
16 years 1 months ago
Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...
Albert Atserias, Mark Weyer
ESA
2009
Springer
111views Algorithms» more  ESA 2009»
16 years 1 months ago
Exact and Approximate Equilibria for Optimal Group Network Formation
We consider a process called Group Network Formation Game, which represents the scenario when strategic agents are building a network together. In our game, agents can have extrem...
Elliot Anshelevich, Bugra Caskurlu