Sciweavers

563 search results - page 2 / 113
» Playing Games with Algorithms: Algorithmic Combinatorial Gam...
Sort
View
SAGT
2010
Springer
127views Game Theory» more  SAGT 2010»
13 years 3 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
ATAL
2007
Springer
13 years 11 months ago
Automatic feature extraction for autonomous general game playing agents
The General Game Playing (GGP) problem is concerned with developing systems capable of playing many different games, even games the system has never encountered before. Successful...
David M. Kaiser
SIGECOM
2006
ACM
139views ECommerce» more  SIGECOM 2006»
13 years 10 months ago
Playing games in many possible worlds
In traditional game theory, players are typically endowed with exogenously given knowledge of the structure of the game—either full omniscient knowledge or partial but fixed in...
Matt Lepinski, David Liben-Nowell, Seth Gilbert, A...
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
13 years 9 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
13 years 10 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman