Title of article :
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games Original Research Article
Author/Authors :
Henrik Bj?rklund، نويسنده , , Sergei Vorobyov، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Abstract :
We suggest the first strongly subexponential and purely combinatorial algorithm for solving the mean payoff games problem. It is based on iteratively improving the longest shortest distances to a sink in a possibly cyclic directed graph.
Keywords :
Mean payoff game , Ergodic partition , Parity game , Combinatorial linear programming , Iterative improvement , Cyclic game , Randomized subexponential algorithm , Longest shortest parth
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
