The complexity of games with randomised control
From MaRDI portal
Cites work
- A game of pawns
- A recursive approach to solving parity games in quasipolynomial time
- Alternating-time temporal logic
- Alternation
- Combinatorial games under auction play
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Faster algorithms for mean-payoff games
- Graph Games and Reactive Synthesis
- scientific article; zbMATH DE number 988850 (Why is no real title available?)
- scientific article; zbMATH DE number 3555903 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Infinite-duration Bidding Games
- Infinite-duration poorman-bidding games
- Positional strategies for mean payoff games
- Probability Inequalities for Sums of Bounded Random Variables
- Quantitative stochastic parity games
- Random-Turn Hex and Other Selection Games
- Reduction of stochastic parity to stochastic mean-payoff games
- Simulation and the Monte Carlo Method
- Solving parity games via priority promotion
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The complexity of mean payoff games on graphs
- The Complexity of Reliability Computations in Planar and Acyclic Graphs
- The complexity of stochastic games
- Tug-of-war and the infinity Laplacian
This page was built for publication: The complexity of games with randomised control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7317475)
