Automatizability and Simple Stochastic Games
The complexity of simple stochastic games (SSGs) has been open since they were defined by Condon in 1992. Despite intensive effort, the complexity of this problem is still unresolved. In this paper, building on the results of , we establish a connection between the complexity of SSGs and the complexity of an important problem in proof complexity–the proof search problem for low depth Frege systems. We prove that if depth-3 Frege systems are weakly automatizable, then SSGs are solvable in polynomial-time. Moreover we identify a natural combinatorial principle, which is a version of the well-known Graph Ordering Principle (GOP), that we call the integer-valued GOP (IGOP). We prove that if depth-2 Frege plus IGOP is weakly automatizable, then SSG is in P.
KeywordsProof System Search Problem Stochastic Game Arithmetic Formula Payoff Game
Unable to display preview. Download preview PDF.
- 1.Alekhnovich, M., Razborov, A.: Resolution is not automatizable unless w[p] is tractable. In: IEEE Symposium on Foundations of Computer Science (2001)Google Scholar
- 6.Blum, M., Juba, B., Williams, R.: Non-monotone behaviors in min/max/avg circuits and their relationship to simple stochastic gamesGoogle Scholar
- 7.Bonet, M., Domingo, C., Gavalda, R., Maciel, A., Pitassi, T.: No feasible interpolation or automatization for AC0-Frege proof systems (1998) (manuscript) Google Scholar
- 10.Buresh-Oppenheim, J., Morioka, T.: Relativized np search problems and propositional proof systems. In: 19th IEEE Conference on Computational Complexity, CCC (2004)Google Scholar
- 11.Chen, X., Deng, X., Teng, S.H.: Settling the complexity of two-player nash equilibria. Journal of the ACM 56 (2009)Google Scholar
- 12.Clegg, M., Edmonds, J., Impagliazzo, R.: Using the Gröbner basis algorithm to find proofs of unsatisfiability. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, pp. 174–183 (May 1996)Google Scholar
- 14.Condon, A.: On algorithms for simple stochastic games. In: Advances in Computational Complexity Theory. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 13, pp. 51–73 (1993)Google Scholar
- 19.Huang, L., Pitassi, T.: Automatizability and simple stochastic games (2011), http://www.cs.toronto.edu/~leih/ssg_full.pdf
- 21.Kumar, V., Tripathi, R.: Algorithmic results in simple stochastic games. Technical Report 855, University of Rochester (2004)Google Scholar