Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
From MaRDI portal
Publication:2233425
DOI10.1007/978-3-030-71995-1_22OpenAlexW3140150357MaRDI QIDQ2233425FDOQ2233425
Authors: Richard M. Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak 
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2101.06989
Cites Work
- Title not available (Why is that?)
- Stochastic Games
- Alternating-time temporal logic
- Title not available (Why is that?)
- Title not available (Why is that?)
- The determinacy of Blackwell games
- Title not available (Why is that?)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- Subexponential lower bounds for randomized pivoting rules for the simplex algorithm
- Undecidable problems for probabilistic automata of fixed dimension
- Supervisory Control of a Class of Discrete Event Processes
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Title not available (Why is that?)
- Quantitative stochastic parity games
- Automata, Languages and Programming
- Markov decision processes with multiple long-run average objectives
- Alternating tree automata, parity games, and modal \(\mu\)-calculus
- Fixed-dimensional energy games are in pseudo-polynomial time
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Title not available (Why is that?)
- Energy parity games
- One-counter Markov decision processes
- Solving parity games on integer vectors
- Computer Science Logic
- Generalized Parity Games
- Decisive Markov Chains
- The complexity of multi-mean-payoff and multi-energy games
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- One-counter stochastic games
- Fun with fireWire: A comparative study of formal verification methods applied to the IEEE 1394 root contention protocol
- Perfect-information stochastic mean-payoff parity games
- Energy parity games
- Exponential lower bounds for policy iteration
- Approximating the termination value of one-counter MDPs and stochastic games
- Optimizing the expected mean payoff in energy Markov decision processes
- Unifying two views on multiple mean-payoff objectives in Markov decision processes
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
- Qualitative analysis of VASS-induced MDPs
- Energy and Mean-Payoff Parity Markov Decision Processes
- Zero-reachability in probabilistic multi-counter automata
- MDPs with energy-parity objectives
- On strong determinacy of countable stochastic games
Cited In (2)
This page was built for publication: Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233425)
