Admissibility in Infinite Games

DOI10.1007/978-3-540-70918-3_17MaRDI QIDQ3590934zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Multistage and repeated games (91A20)

Recommendations

• The complexity of admissibility in omega-regular games
• Infinite coordination games
• Iterated strict dominance in general games
• Iterated admissibility through forcing in strategic belief models
• Admissibility in Games

Cited in

(23)

• On the existence of weak subgame perfect equilibria
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• On the existence of weak subgame perfect equilibria
• Static search games played over graphs and general metric spaces
• scientific article; zbMATH DE number 7447732 (Why is no real title available?)
• Reasoning about Quality and Fuzziness of Strategic Behaviors
• Synthesis for Structure Rewriting Systems
• scientific article; zbMATH DE number 7649921 (Why is no real title available?)
• Infinite coordination games
• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
• Stackelberg-Pareto synthesis
• The complexity of subgame perfect equilibria in quantitative reachability games
• With a little help from your friends: semi-cooperative games via joker moves
• scientific article; zbMATH DE number 6862070 (Why is no real title available?)
• Iterated Elimination of Weakly Dominated Strategies in Well-Founded Games
• Improving parity games in practice
• Solving parity games using an automata-based algorithm
• scientific article; zbMATH DE number 7447731 (Why is no real title available?)
• The complexity of admissibility in omega-regular games
• A game-theoretic approach for the synthesis of complex systems
• Assume-admissible synthesis
• Admissible Strategies in Infinite Games over Graphs
• scientific article; zbMATH DE number 7533335 (Why is no real title available?)

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)