Time-Optimal Winning Strategies for Poset Games

Abstract

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… (More)
DOI: 10.1007/978-3-642-02979-0_25
View Slides

Topics

6 Figures and Tables