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...
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, T...
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 ...
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...
Alessandro Lazaric, Jose Enrique Munoz de Cote, Ni...
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...