115 search results - page 1 / 23 » Finding Optimal Abstract Strategies in Extensive-Form Games |
AAAI
2012
11 years 7 months ago
2012
COCOON
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider finding maximin strategies and equilibria of explicitly given extensive form games with imperfect information but with no moves of chance. We show that a max...
WINE
2007
Springer
13 years 11 months ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
SIGECOM
2006
ACM
13 years 10 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...