1599 search results - page 34 / 320 » Algorithms for Parity Games |
FORMATS
2005
Springer
15 years 3 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 ...
FOCS
2005
IEEE
15 years 3 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...
CG
2002
Springer
14 years 9 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...
GECCO
2004
Springer
15 years 3 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 ...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....