5995 search results - page 81 / 1199 » Algorithmic Game Theory |
122
click to vote
AMAI
2004
Springer
15 years 1 months ago
2004
Springer
Sequential von Neumann-Morgernstern (VM) games are a very general formalism for representing multi-agent interactions and planning problems in a variety of types of environments. ...
FORMATS
2005
Springer
15 years 7 months ago
2005
Springer
We consider real-time games where the goal consists, for each player, in maximizing the average amount of reward he or she receives per time unit. We consider zero-sum rewards, so ...
109
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 − O(1/ log n), satisfies a constant fraction of constraints, wher...
105
click to vote
CG
2002
Springer
15 years 1 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...
103
click to vote
GECCO
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We use case injected genetic algorithms to learn to competently play computer strategy games. Such games are characterized by player decision in anticipation of opponent ...