Pages that link to "Item:Q3471889"
From MaRDI portal
The following pages link to Cyclic games and an algorithm to find minimax cycle means in directed graphs (Q3471889):
Displaying 50 items.
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) (Q293426) (← links)
- Exponential examples of solving parity games (Q327255) (← links)
- On canonical forms for zero-sum stochastic mean payoff games (Q367425) (← links)
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games (Q409428) (← links)
- Tropical linear-fractional programming and parametric mean payoff games (Q435971) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← 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)
- Faster algorithms for mean-payoff games (Q537946) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- On short paths interdiction problems: Total and node-wise limited interdiction (Q929289) (← links)
- Cyclic games and linear programming (Q944703) (← links)
- Scientific contributions of Leo Khachiyan (a short overview) (Q944704) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- Equilibria in nonantagonistic positional games on graphs and searching for them (Q1642049) (← 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)
- Solving parity games via priority promotion (Q1742991) (← links)
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions (Q1755732) (← links)
- A delayed promotion policy for parity games (Q1784960) (← links)
- Memoryless determinacy of parity and mean payoff games: a simple proof (Q1884982) (← links)
- Optimal paths in network games with \(p\) players (Q1962055) (← links)
- The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
- Robust worst cases for parity games algorithms (Q2182730) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness (Q2450666) (← 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)
- Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (Q3012799) (← links)
- On Memoryless Quantitative Objectives (Q3088278) (← links)
- From Parity and Payoff Games to Linear Programming (Q3182965) (← links)
- (Q3384167) (← links)
- Discrete control and algorithms for solving antagonistic dynamic games on networks (Q3391895) (← links)
- Nash Equilibria Conditions for Cyclic Games with p Players (Q3439488) (← links)
- Tropicalizing the Simplex Algorithm (Q3453613) (← links)
- (Q3812077) (← links)
- A search game on a cyclic graph (Q4651727) (← links)
- On Solving Mean Payoff Games Using Pivoting Algorithms (Q4689394) (← links)
- (Q5015267) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)