Priority promotion with Parysian flair
From MaRDI portal
Publication:6627044
DOI10.1016/J.JCSS.2024.103580MaRDI QIDQ6627044
Fabio Mogavero, Dominik Wojtczak, Massimo Benerecetti, Sven Schewe, Daniele Dell'Erba
Publication date: 29 October 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Games involving graphs (91A43) Algorithmic game theory and complexity (91A68)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Invariants for the construction of a handshake register
- Solving parity games in big steps
- Improving parity game solvers with justifications
- Results on the propositional \(\mu\)-calculus
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Strategy logic
- Borel determinacy
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Infinite games played on finite graphs
- The complexity of mean payoff games on graphs
- An improved algorithm for the evaluation of fixpoint expressions
- Solving parity games via priority promotion
- Fixed-point logics and solitaire games
- A delayed promotion policy for parity games
- Automata, logics, and infinite games. A guide to current research
- A subexponential randomized algorithm for the simple stochastic game problem
- Robust worst cases for parity games algorithms
- A superpolynomial lower bound for strategy iteration based on snare memorization
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games
- Non-oblivious Strategy Improvement
- Recursive algorithm for parity games requires exponential time
- An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms
- A Deterministic Subexponential Algorithm for Solving Parity Games
- Symmetric Strategy Improvement
- Alternating-time temporal logic
- ATL* Satisfiability Is 2EXPTIME-Complete
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
- A deterministic subexponential algorithm for solving parity games
- Satisfiability and Finite Model Property for the Alternating-Time μ-Calculus
- Tighter Bounds for the Determinisation of Büchi Automata
- Solving Parity Games in Practice
- Solving Parity Games via Priority Promotion
- Deciding parity games in quasipolynomial time
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time
- A modal μ perspective on solving parity games in quasi-polynomial time
- Solving Mean-Payoff Games via Quasi Dominions
- Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
- Substructure Temporal Logic
- On model checking for the \(\mu\)-calculus and its fragments
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Attracting tangles to solve parity games
- Solving mean-payoff games via quasi dominions
This page was built for publication: Priority promotion with Parysian flair
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6627044)