Time-Optimal Winning Strategies for Poset Games

DOI10.1007/978-3-642-02979-0_25MaRDI QIDQ3637359zbMATH OpenOpenAlexFDO

Authors Martín G. Zimmermann

Publication date 9 July 2009

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL http://publications.rwth-aachen.de/record/47788

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Optimizing Winning Strategies in Regular Infinite Games
• On the complexity of computing winning strategies for finite poset games
• Mathematical Foundations of Computer Science 2004

Cites work

• Automata, logics, and infinite games. A guide to current research
• Positional strategies for mean payoff games
• Symbolic synthesis of finite-state controllers for request-response specifications
• The complexity of mean payoff games on graphs
• Time-Optimal Winning Strategies for Poset Games

Cited in

(10)

• On equilibria in quantitative games with reachability/safety objectives
• Time-aware uniformization of winning strategies
• The complexity of request-response games
• Extracting winning strategies in update games
• Multiplayer cost games with simple Nash equilibria
• Time-Optimal Winning Strategies for Poset Games
• Down the Borel hierarchy: solving Muller games via safety games
• Deciding the Winner of an Arbitrary Finite Poset Game Is PSPACE-Complete
• On the complexity of computing winning strategies for finite poset games
• Polynomial time winning strategies for three variants of \((s,t)\)-Wythoff's game

This page was built for publication: Time-Optimal Winning Strategies for Poset Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637359)