Mean-Payoff Games and Propositional Proofs

We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in Σ2-Frege (a.k.a. DNF-resolution). This reduces the problem of solving mean-payoff games to the weak automatizability of Σ2-Frege, and to the interpolation problem for Σ2,2-Frege. Since the interpolation problem for Σ1-Frege (i.e. resolution) is solvable in polynomial time, our result is close to optimal up to the computational complexity of solving mean-payoff games. The proof of the main result requires building low-depth formulas that compute the bits of the sum of a constant number of integers in binary notation, and low-complexity proofs of their relevant arithmetic properties.

[1]  Salil P. Vadhan,et al.  Computational Complexity , 2005, Encyclopedia of Cryptography and Security.

[2]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3]  Toniann Pitassi,et al.  Effectively Polynomial Simulations , 2010, ICS.

[4]  Pavel Pudlák,et al.  On reducibility and symmetry of disjoint NP pairs , 2003, Theor. Comput. Sci..

[5]  P. Pudlák.  Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .

[6]  Albert Atserias,et al.  Mean-Payoff Games and the Max-Atom Problem , 2009 .

[7]  Maria Luisa Bonet,et al.  Lower Bounds for the Weak Pigeonhole Principle and Random Formulas beyond Resolution , 2002, Inf. Comput..

[8]  Jan Krajícek,et al.  Some Consequences of Cryptographical Conjectures for S12 and EF , 1998, Inf. Comput..

[9]  J. Kraj.  On the Weak Pigeonhole Principle , 2001 .

[10]  Toniann Pitassi,et al.  Non-Automatizability of Bounded-Depth Frege Proofs , 2004, computational complexity.

[11]  P. Pudlák.  Chapter VIII - The Lengths of Proofs , 1998 .

[12]  Henrik Björklund,et al.  Combinatorial structure and randomized subexponential algorithms for infinite games , 2005, Theor. Comput. Sci..

[13]  Maria Luisa Bonet,et al.  Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution , 2001, ICALP.

[14]  A. Ehrenfeucht,et al.  Positional strategies for mean payoff games , 1979 .

[15]  Maria Luisa Bonet,et al.  On the automatizability of resolution and related propositional proof systems , 2002, Inf. Comput..

[16]  Uri Zwick,et al.  A deterministic subexponential algorithm for solving parity games , 2006, SODA '06.

[17]  Enric Rodríguez-Carbonell,et al.  The Max-Atom Problem and Its Relevance , 2008, LPAR.

[18]  Toniann Pitassi,et al.  Propositional Proof Complexity: Past, Present and Future , 2001, Bull. EATCS.

[19]  Toniann Pitassi,et al.  Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[20]  J. Krajícek.  On the weak pigeonhole principle , 2001 .

[21]  Ran Raz,et al.  On Interpolation and Automatization for Frege Systems , 2000, SIAM J. Comput..

[22]  Nir Halman,et al.  Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems , 2007, Algorithmica.

[23]  Czech Republickrajicek.  Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic , 2007 .

[24]  Jirí Sgall,et al.  Algebraic models of computation and interpolation for algebraic proof systems , 1996, Proof Complexity and Feasible Arithmetics.

[25]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[26]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, STOC '95.

[27]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[28]  Michael Alekhnovich,et al.  Resolution Is Not Automatizable Unless W[P] Is Tractable , 2008, SIAM J. Comput..

[29]  Pavel Pudl ak a.  On reducibility and symmetry of disjoint NP pairs , 2003 .

[30]  Rolf H. Möhring,et al.  Scheduling with AND/OR Precedence Constraints , 2004, SIAM J. Comput..

[31]  Uri Zwick,et al.  The Complexity of Mean Payoff Games on Graphs , 1996, Theor. Comput. Sci..

[32]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[33]  Marcin Jurdziński,et al.  Deciding the Winner in Parity Games is in UP \cap co-Up , 1998, Inf. Process. Lett..

[34]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.