Pages that link to "Item:Q1351468"
From MaRDI portal
The following pages link to The complexity of mean payoff games on graphs (Q1351468):
Displayed 50 items.
- Planning and acting in partially observable stochastic domains (Q72343) (← links)
- Expected reachability-time games (Q278757) (← links)
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
- Solving parity games in big steps (Q340584) (← links)
- The fixed initial credit problem for partial-observation energy games is \textsc{Ack}-complete (Q344560) (← links)
- Strategy improvement for concurrent reachability and turn-based stochastic safety games (Q355506) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- A survey of stochastic \(\omega \)-regular games (Q414898) (← links)
- Solving parity games by a reduction to SAT (Q414902) (← links)
- The complexity of stochastic Müller games (Q418128) (← links)
- Tropical linear-fractional programming and parametric mean payoff games (Q435971) (← links)
- Synthesis of opaque systems with static and dynamic masks (Q453510) (← links)
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Interface simulation distances (Q477211) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Minimal sensor activation and minimal communication in discrete-event systems (Q503031) (← links)
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- Determining the optimal strategies for zero-sum average stochastic positional games (Q510975) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- A nested family of \(k\)-total effective rewards for positional games (Q521891) (← links)
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362) (← links)
- Quantitative fair simulation games (Q528184) (← links)
- First-cycle games (Q528186) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- Tropical polar cones, hypergraph transversals, and mean payoff games (Q550656) (← links)
- On strategy improvement algorithms for simple stochastic games (Q635740) (← links)
- Mean-payoff games and propositional proofs (Q716324) (← links)
- Quantitative simulations by matrices (Q729815) (← links)
- Simulation distances (Q764284) (← links)
- Contingent planning under uncertainty via stochastic satisfiability (Q814473) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- Randomness for free (Q897644) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Stochastic limit-average games are in EXPTIME (Q933752) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Reduction of stochastic parity to stochastic mean-payoff games (Q963321) (← links)
- An efficient algorithm for a class of constraint satisfaction problems (Q1611994) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- An average polynomial algorithm for solving antagonistic games on graphs (Q1647454) (← links)
- Safraless LTL synthesis considering maximal realizability (Q1674867) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm (Q1706164) (← links)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- Solving parity games via priority promotion (Q1742991) (← links)