The complexity of admissibility in Omega-regular games

DOI10.1145/2603088.2603143zbMATH Open1401.68110arXiv1304.1682OpenAlexW2121894842MaRDI QIDQ4635606FDOQ4635606

Mathieu Sassolas, Romain Brenguier, Jean-François Raskin

Publication date: 23 April 2018

Published in: Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Abstract: Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games played on graphs with omega-regular objectives. In this paper, we study the algorithmic properties of this concept for such games. We settle the exact complexity of natural decision problems on the set of strategies that survive iterated elimination of dominated strategies. As a byproduct of our construction, we obtain automata which recognize all the possible outcomes of such strategies.

Full work available at URL: https://arxiv.org/abs/1304.1682

zbMATH Keywords

synthesisLTLsafetyMuller gamesadmissible strategies

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Cited In (12)

• Title not available (Why is that?)
• A game-theoretic approach for the synthesis of complex systems
• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
• On the existence of weak subgame perfect equilibria
• Title not available (Why is that?)
• On the Existence of Weak Subgame Perfect Equilibria
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Dynamic hierarchical reactive controller synthesis
• Assume-admissible synthesis
• Title not available (Why is that?)

This page was built for publication: The complexity of admissibility in Omega-regular games

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