Looking at mean-payoff and total-payoff through windows

We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window. © 2013 Springer International Publishing.

[1]  Alexander V. Karzanov,et al.  Cyclical games with prohibitions , 1993, Math. Program..

[2]  M. Minsky.  Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .

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

[4]  A. Karzanov,et al.  Cyclic games and an algorithm to find minimax cycle means in directed graphs , 1990 .

[5]  Thomas A. Henzinger,et al.  Resource Interfaces , 2003, EMSOFT.

[6]  Joël Ouaknine,et al.  Nets with Tokens which Carry Data , 2008, Fundam. Informaticae.

[7]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[8]  Philippe Schnoebelen,et al.  Reset Nets Between Decidability and Undecidability , 1998, ICALP.

[9]  Véronique Bruyère,et al.  Synthesis from LTL Specifications with Mean-Payoff Objectives , 2012, TACAS.

[10]  Krishnendu Chatterjee,et al.  Approximating the minimum cycle mean , 2013, GandALF.

[11]  L. Brim,et al.  Faster algorithms for mean-payoff games , 2011, Formal Methods Syst. Des..

[12]  J. Filar,et al.  Competitive Markov Decision Processes , 1996 .

[13]  Véronique Bruyère,et al.  Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games , 2013, STACS.

[14]  Krishnendu Chatterjee,et al.  Generalized Mean-payoff and Energy Games , 2010, FSTTCS.

[15]  Krishnendu Chatterjee,et al.  Infinite-state games with finitary conditions , 2013, CSL.

[16]  Krishnendu Chatterjee,et al.  Strategy synthesis for multi-dimensional quantitative objectives , 2012, Acta Informatica.

[17]  Orna Kupferman,et al.  From liveness to promptness , 2009, Formal Methods Syst. Des..

[18]  Thomas A. Henzinger,et al.  Finitary fairness , 1998, TOPL.

[19]  Krishnendu Chatterjee,et al.  Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition , 2014, J. ACM.

[20]  Henrik Björklund,et al.  A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games , 2007, Discrete Applied Mathematics.

[21]  Krishnendu Chatterjee,et al.  Finitary Winning in omega-Regular Games , 2006, TACAS.

[22]  Alexander Moshe Rabinovich,et al.  Church Synthesis Problem for Noisy Input , 2011, FoSSaCS.

[23]  Nicolai N. Pisaruk,et al.  Mean Cost Cyclical Games , 1999, Math. Oper. Res..

[24]  Nathanael Fijalkow,et al.  The surprizing complexity of generalized reachability games , 2010 .

[25]  S. Lippman,et al.  Stochastic Games with Perfect Information and Time Average Payoff , 1969 .

[26]  W. Ackermann.  Zum Hilbertschen Aufbau der reellen Zahlen , 1928 .

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

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

[29]  Philippe Schnoebelen,et al.  Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..

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

[31]  Helmut Seidl,et al.  Games through Nested Fixpoints , 2009, CAV.

[32]  Y. Lifshits,et al.  Potential theory for mean payoff games , 2007 .

[33]  Krishnendu Chatterjee,et al.  Looking at mean-payoff and total-payoff through windows , 2015, Inf. Comput..

[34]  Krishnendu Chatterjee,et al.  Polynomial-Time Algorithms for Energy Games with Special Weight Structures , 2012, Algorithmica.

[35]  M. Paterson,et al.  The complexity of mean payo games on graphs , 1996 .

[36]  Hugo Gimbert,et al.  When Can You Play Positionally? , 2004, MFCS.

[37]  Marcin Jurdzinski,et al.  Model Checking Probabilistic Timed Automata with One or Two Clocks , 2007, Log. Methods Comput. Sci..

[38]  Krishnendu Chatterjee,et al.  An O(n2) time algorithm for alternating Büchi games , 2011, SODA.