Sciweavers

1410 search results - page 126 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
DAGSTUHL
2007
15 years 29 days ago
The Unique Games Conjecture with Entangled Provers is False
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
Julia Kempe, Oded Regev, Ben Toner
AAAI
2006
15 years 28 days ago
Prob-Maxn: Playing N-Player Games with Opponent Models
Much of the work on opponent modeling for game tree search has been unsuccessful. In two-player, zero-sum games, the gains from opponent modeling are often outweighed by the cost ...
Nathan R. Sturtevant, Martin Zinkevich, Michael H....
AI
2004
Springer
14 years 11 months ago
Efficient learning equilibrium
Efficient Learning Equilibrium (ELE) is a natural solution concept for multi-agent encounters with incomplete information. It requires the learning algorithms themselves to be in ...
Ronen I. Brafman, Moshe Tennenholtz
EVOW
2010
Springer
15 years 6 months ago
Search-Based Procedural Content Generation
Recently, a small number of papers have appeared in which the authors implement stochastic search algorithms, such as evolutionary computation, to generate game content, such as le...
Julian Togelius, Georgios N. Yannakakis, Kenneth O...