Cost-parity and cost-Streett games
From MaRDI portal
Publication:2957486
DOI10.4230/LIPICS.FSTTCS.2012.124zbMATH Open1354.68151MaRDI QIDQ2957486FDOQ2957486
Authors: Nathanaël Fijalkow, Martín G. Zimmermann 
Publication date: 26 January 2017
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Games involving graphs (91A43)
Cited In (18)
- Hierarchical cost-parity games
- Hierarchical cost-parity games
- Prompt interval temporal logic
- Quantifying Bounds in Strategy Logic
- Solving parity games via priority promotion
- On the cost of game playing: how to control the expenses in mixed strategies
- Finitary winning in \({\omega}\)-regular games
- Quantitative fairness games
- Easy to win, hard to master: optimal strategies in parity games with costs
- Parity games with weights
- Parity and Streett games with costs
- Games with bound guess actions
- Solving counter parity games
- Tools and Algorithms for the Construction and Analysis of Systems
- Faster Algorithms for Finitary Games
- Down the Borel hierarchy: solving Muller games via safety games
- Title not available (Why is that?)
- Price of Competition and Dueling Games
This page was built for publication: Cost-parity and cost-Streett games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957486)
