Sciweavers

1410 search results - page 50 / 282
» The Algorithmics of Solitaire-Like Games
Sort
View
76
Voted
ATAL
2005
Springer
15 years 4 months ago
Automatic computer game balancing: a reinforcement learning approach
Designing agents whose behavior challenges human players adequately is a key issue in computer games development. This work presents a novel technique, based on reinforcement lear...
Gustavo Andrade, Geber Ramalho, Hugo Santana, Vinc...
NOSSDAV
2005
Springer
15 years 4 months ago
Using n-trees for scalable event ordering in peer-to-peer games
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
Chris GauthierDickey, Virginia Mary Lo, Daniel Zap...
89
Voted
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
15 years 4 months ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
JELIA
2004
Springer
15 years 4 months ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
ECML
2003
Springer
15 years 4 months ago
Self-evaluated Learning Agent in Multiple State Games
Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
Koichi Moriyama, Masayuki Numao