Sciweavers

533 search results - page 6 / 107
» Playing games with approximation algorithms
Sort
View
SAGT
2010
Springer
127views Game Theory» more  SAGT 2010»
13 years 5 months ago
On the Rate of Convergence of Fictitious Play
Fictitious play is a simple learning algorithm for strategic games that proceeds in rounds. In each round, the players play a best response to a mixed strategy that is given by the...
Felix Brandt, Felix A. Fischer, Paul Harrenstein
ICML
2003
IEEE
14 years 22 days ago
The Significance of Temporal-Difference Learning in Self-Play Training TD-Rummy versus EVO-rummy
Reinforcement learning has been used for training game playing agents. The value function for a complex game must be approximated with a continuous function because the number of ...
Clifford Kotnik, Jugal K. Kalita
WAOA
2010
Springer
251views Algorithms» more  WAOA 2010»
13 years 5 months ago
How to Play Unique Games on Expanders
In this paper, we improve a result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a (1-)-satisfiable instance of Uniq...
Konstantin Makarychev, Yury Makarychev
CHI
2011
ACM
12 years 11 months ago
Target assistance for subtly balancing competitive play
In games where skills such as targeting are critical to winning, it is difficult for players with different skill levels to have a competitive and engaging experience. Although se...
Scott Bateman, Regan L. Mandryk, Tadeusz Stach, Ca...