Admissibility in Infinite Games
From MaRDI portal
Publication:3590934
DOI10.1007/978-3-540-70918-3_17zbMATH Open1186.68278OpenAlexW1481074184MaRDI QIDQ3590934FDOQ3590934
Authors: Dietmar Berwanger 
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_17
Recommendations
Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Multistage and repeated games (91A20)
Cited In (22)
- Title not available (Why is that?)
- Improving parity games in practice
- A game-theoretic approach for the synthesis of complex systems
- The complexity of subgame perfect equilibria in quantitative reachability games
- The complexity of admissibility in omega-regular games
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
- On the existence of weak subgame perfect equilibria
- On the existence of weak subgame perfect equilibria
- Solving parity games using an automata-based algorithm
- Admissible Strategies in Infinite Games over Graphs
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Infinite coordination games
- Stackelberg-Pareto synthesis
- Title not available (Why is that?)
- With a little help from your friends: semi-cooperative games via joker moves
- Assume-admissible synthesis
- Synthesis for Structure Rewriting Systems
- Title not available (Why is that?)
- Static search games played over graphs and general metric spaces
This page was built for publication: Admissibility in Infinite Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590934)
