Sciweavers

Share
SODA
2008
ACM

Fast algorithms for finding proper strategies in game trees

8 years 3 months ago
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.
Peter Bro Miltersen, Troels Bjerre Sørensen
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SODA
Authors Peter Bro Miltersen, Troels Bjerre Sørensen
Comments (0)
books