25 search results - page 3 / 5 » Algorithms for Omega-Regular Games with Imperfect Informatio... |
ATAL
2011
Springer
12 years 5 months ago
2011
Springer
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opp...
CG
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Years of work have gone into algorithms and optimizations for twoplayer perfect-information games such as Chess and Checkers. It is only more recently that serious resear...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We show how to find a normal form proper equilibrium in behavior strategies of a given two-player zero-sum extensive form game with imperfect information but perfect recall. Our a...
WINE
2007
Springer
13 years 12 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 ï¬...
SARA
2009
Springer
14 years 11 days ago
2009
Springer
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...