On Solving Mean Payoff Games Using Pivoting Algorithms

Two classical pivoting algorithms, due to Lemke and Cottle–Dantzig, are studied on linear complementarity problems (LCPs) and their generalizations that arise from infinite duration two-person mean payoff games (MPGs) under zero-mean partition problem. Lemke’s algorithm was studied in solving MPGs via reduction to discounted payoff games or to simple stochastic games. We provide an alternative and efficient approach for studying the LCPs arising from the MPGs without any reduction. A binary MPG can easily be formulated as an LCP which has always terminated in a complementary solution in numerical experiments, but has not yet been proven either the processability of MPG’s by Lemke’s algorithm or a counter example that it will not terminate with a solution. Till now, the processability of MPG’s by Lemke’s algorithm remains open. A general MPG (with arbitrary outgoing arcs) naturally reduces to a generalized linear complementarity problem (GLCP) involving a rectangular matrix where the vertices are represented by the columns and the outgoing arcs from each vertex are represented by rows in a particular block. The noteworthy result in this paper is that the GLCP obtained from an MPG is processable by Cottle–Dantzig principal pivoting algorithm which terminates with a solution. Several properties of the matrix which arise in this context are also discussed.