Reachability Switching Games
From MaRDI portal
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Applications of game theory (91A80)
Recommendations
- Reachability switching games
- Concurrent reachability games
- Reachability games and parity games
- Reachability games with relaxed energy constraints
- Reachability games with relaxed energy constraints
- Expected reachability-time games
- Expected reachability-time games
- Additional winning strategies in reachability games
Cites work
- A simplified NP-complete satisfiability problem
- An algorithmic study of switch graphs
- ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\)
- ARRIVAL: next stop in CLS
- Chip-Firing and Rotor-Routing on Directed Graphs
- Deterministic random walks on regular trees
- Deterministic random walks on the integers
- Deterministic random walks on the two-dimensional grid
- Did the train reach its destination: the complexity of finding a witness
- scientific article; zbMATH DE number 17815 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 784042 (Why is no real title available?)
- Quasirandom load balancing
- Rotor walks and Markov chains
- Simulating a Random Walk with Constant Error
- SWITCHING GRAPHS
- The complexity of stochastic games
- The Simple Reachability Problem in Switch Graphs
Cited in
(8)- Reachability in succinct one-counter games
- Trains, games, and complexity: 0/1/2-player motion planning through input/output gadgets
- On the complexity of counter reachability games
- Reachability switching games
- ARRIVAL: next stop in CLS
- Did the train reach its destination: the complexity of finding a witness
- Hardness of continuous local search: query complexity and cryptographic lower bounds
- A subexponential algorithm for ARRIVAL
This page was built for publication: Reachability Switching Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5002810)
