Pages that link to "Item:Q867862"
From MaRDI portal
The following pages link to A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862):
Displaying 39 items.
- Solving parity games in big steps (Q340584) (← links)
- Tropical linear-fractional programming and parametric mean payoff games (Q435971) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- An average polynomial algorithm for solving antagonistic games on graphs (Q1647454) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- Computation of weighted sums of rewards for concurrent MDPs (Q1731592) (← links)
- Abstract tropical linear programming (Q2188843) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- The level set method for the two-sided max-plus eigenproblem (Q2393147) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- A superpolynomial lower bound for strategy iteration based on snare memorization (Q2446310) (← links)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- TROPICAL POLYHEDRA ARE EQUIVALENT TO MEAN PAYOFF GAMES (Q2882394) (← links)
- USING STRATEGY IMPROVEMENT TO STAY ALIVE (Q2909219) (← links)
- Tropical Fourier–Motzkin elimination, with an application to real-time verification (Q2923336) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Synthesising Strategy Improvement and Recursive Algorithms for Solving 2.5 Player Parity Games (Q2961570) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- Tropicalizing the Simplex Algorithm (Q3453613) (← links)
- Incentive Stackelberg Mean-Payoff Games (Q4571136) (← links)
- On Solving Mean Payoff Games Using Pivoting Algorithms (Q4689394) (← links)
- (Q5021006) (← links)
- (Q5079761) (← links)
- (Q5091276) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- Solving Mean-Payoff Games via Quasi Dominions (Q5164175) (← links)
- (Q5232902) (← links)
- The Complexity of Infinitely Repeated Alternating Move Games (Q5326613) (← links)
- Solving Parity Games in Big Steps (Q5458856) (← links)
- Tropical Linear Regression and Mean Payoff Games: Or, How to Measure the Distance to Equilibria (Q6101017) (← links)
- Solving mean-payoff games via quasi dominions (Q6204169) (← links)
- Priority promotion with Parysian flair (Q6627044) (← links)