scientific article
From MaRDI portal
Publication:3384876
Publication date: 17 December 2021
Full work available at URL: https://arxiv.org/abs/1809.03093
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Assume-admissible synthesis
- Deterministic one-counter automata
- Borel determinacy
- On limit cycles of monotone functions with symmetric connection graph
- Generalized Mean-payoff and Energy Games
- Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time
- The Descriptive Complexity of Parity Games
- Admissibility in Infinite Games
- Manipulation of Voting Schemes: A General Result
- Fixed Point Logics
- The complexity of admissibility in Omega-regular games
- Monotone Boolean functions
- Deciding parity games in quasipolynomial time
- Admissiblity in Concurrent Games
- Admissible Strategies in Timed Games
- A short proof of Sperner's lemma
This page was built for publication:
