5995 search results - page 199 / 1199 » Algorithmic Game Theory |
130
click to vote
ATAL
2005
Springer
15 years 9 months ago
2005
Springer
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...
133
click to vote
COCO
2004
Springer
15 years 9 months ago
2004
Springer
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...
109
click to vote
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
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 ...
106
click to vote
ECML
2003
Springer
15 years 9 months ago
2003
Springer
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...
152
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while...