Fast algorithms for finding proper strategies in game trees

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 algorithm solves a finite sequence of linear programs and runs in polynomial time. For the case of a perfect information game, we show how to find a normal form proper equilibrium in linear time by a simple backwards induction procedure.

• Type: Conference
• Year: 2008
• Where: SODA
• Authors: Peter Bro Miltersen, Troels Bjerre Sørensen
• Keywords: Algorithms, Form Proper Equilibrium, Normal Form, SODA 2008, Zero-sum Extensive Form