Time-Optimal Winning Strategies for Poset Games

DOI10.1007/978-3-642-02979-0_25zbMath1248.91024OpenAlexW1829083937MaRDI QIDQ3637359

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)

Related Items (4)

Multiplayer Cost Games with Simple Nash Equilibria ⋮ On equilibria in quantitative games with reachability/safety objectives ⋮ Down the Borel hierarchy: solving Muller games via safety games ⋮ Time-Optimal Winning Strategies for Poset Games

Cites Work

• Positional strategies for mean payoff games
• The complexity of mean payoff games on graphs
• Automata, logics, and infinite games. A guide to current research
• Optimal strategy synthesis for request-response games
• Symbolic Synthesis of Finite-State Controllers for Request-Response Specifications
• Time-Optimal Winning Strategies for Poset Games

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