Sciweavers

3455 search results - page 5 / 691
» Generalized Game Trees
Sort
View
87
Voted
AAAI
2012
13 years 14 days ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
AAAI
2007
15 years 12 days ago
Heuristic Evaluation Functions for General Game Playing
A general game playing program plays games that it has not previously encountered. A game manager program sends the game playing programs a description of a game’s rules and obj...
James Clune
CONCUR
2007
Springer
15 years 4 months ago
Strategy Logic
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 4 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
ICLP
2009
Springer
15 years 10 months ago
Answer Set Programming for Single-Player Games in General Game Playing
As a novel, grand AI challenge, General Game Playing is concerned with the development of systems that understand the rules of unknown games and play these games well without human...
Michael Thielscher