Time-Optimal Winning Strategies for Poset Games

We introduce a novel winning condition for infinite two-player games on graphs which extends the request-response condition and better matches concrete applications in scheduling or project planning. In a poset game, a request has to be responded by multiple events in an ordering over time that is compatible with a given partial ordering of the events. Poset games are zero-sum, but there are plays that are more desirable than others, i.e., those in which the requests are served quickly. We show that optimal strategies (with respect to long term average accumulated waiting times) exist. These strategies are implementable with finite memory and are effectively computable.

[1]  Mesut Gunes,et al.  From Simulations to Testbeds — Architecture of the Hybrid MCG-Mesh Testbed , 2006 .

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

[3]  Shmuel Zaks,et al.  A New Intersection Model and Improved Algorithms for Tolerance Graphs , 2009, SIAM J. Discret. Math..

[4]  Wolfgang Thomas,et al.  Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications , 2003, CIAA.

[5]  Joachim Kneis,et al.  Derandomizing Non-uniform Color-Coding I , 2009 .

[6]  T. Kraußer,et al.  A Probabilistic Justification of the Combining Calculus under the Uniform Scheduler Assumption , 2007 .

[7]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[8]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[9]  Jürgen Giesl,et al.  SAT Solving for Termination Analysis with Polynomial Interpretations , 2007, SAT.

[10]  Florian Horn,et al.  Optimal Strategy Synthesis in Request-Response Games , 2008, ATVA.

[11]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

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

[13]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[14]  Nico Wallmeier,et al.  Strategien in unendlichen Spielen mit Liveness-Gewinnbedingungen: Syntheseverfahren, Optimierung und Implementierung , 2005 .