Sciweavers

800 search results - page 94 / 160
» On the Complexity of Parity Games
Sort
View
ICC
2007
IEEE
158views Communications» more  ICC 2007»
14 years 3 months ago
Cooperative Game Theory for Distributed Spectrum Sharing
— There is a need for new spectrum access protocols that are opportunistic, flexible and efficient, yet fair. Game theory provides a framework for analyzing spectrum access, a ...
Juan E. Suris, Luiz A. DaSilva, Zhu Han, Allen B. ...
CSL
2007
Springer
14 years 3 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
ATAL
2004
Springer
14 years 2 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...
EWCBR
2008
Springer
13 years 11 months ago
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
Kinshuk Mishra, Santiago Ontañón, As...
COR
2008
142views more  COR 2008»
13 years 9 months ago
Application of reinforcement learning to the game of Othello
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...
Nees Jan van Eck, Michiel C. van Wezel