Sciweavers

3780 search results - page 16 / 756
» Algorithms for Game Metrics
Sort
View
ISAAC
2009
Springer
169views Algorithms» more  ISAAC 2009»
14 years 2 months ago
The Complexity of Solving Stochastic Games on Graphs
We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. Generalizing and unifying results of Liggett and...
Daniel Andersson, Peter Bro Miltersen
FORMATS
2005
Springer
14 years 1 months ago
Average Reward Timed Games
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 ...
B. Thomas Adler, Luca de Alfaro, Marco Faella
FOCS
2005
IEEE
14 years 1 months ago
Approximation Algorithms for Unique Games
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...
Luca Trevisan
CG
2002
Springer
13 years 7 months ago
A Comparison of Algorithms for Multi-player Games
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...
Nathan R. Sturtevant
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
14 years 26 days ago
Trap Avoidance in Strategic Computer Game Playing with Case Injected Genetic Algorithms
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 ...
Chris Miles, Sushil J. Louis, Rich Drewes