Cyclic games and linear programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3128733 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3542195 (Why is no real title available?)
- scientific article; zbMATH DE number 1059247 (Why is no real title available?)
- scientific article; zbMATH DE number 1962853 (Why is no real title available?)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- A deterministic subexponential algorithm for solving parity games
- A generalization of the linear complementarity problem
- A subexponential bound for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial structure and randomized subexponential algorithms for infinite games
- Completely unimodal numberings of a simple polytope
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Cyclical games with prohibitions
- Existence and uniqueness of solutions for the generalized linear complementarity problem
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
- Extensions of two person zero sum games
- From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
- Fundamentals of Computation Theory
- Linear Programming Polytope and Algorithm for Mean Payoff Games
- Linear programming, the simplex algorithm and simple polytopes
- Maximizing the minimum source-sink path subject to a budget constraint
- Mean cost cyclical games
- Memoryless determinacy of parity and mean payoff games: a simple proof
- On Nonterminating Stochastic Games
- On short paths interdiction problems: Total and node-wise limited interdiction
- Positional strategies for mean payoff games
- Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
- Shortest-path network interdiction
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Stochastic Games
- The P-matrix problem is co-NP-complete
- The complexity of mean payoff games on graphs
- The complexity of stochastic games
- The generalized linear complementarity problem: Least element theory and Z-matrices
Cited in
(15)- On solving mean payoff games using pivoting algorithms
- On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
- scientific article; zbMATH DE number 4081342 (Why is no real title available?)
- Nash-solvable two-person symmetric cycle game forms
- Linear complementarity algorithms for infinite games
- Approximation schemes for stochastic mean payoff games with perfect information and few random positions
- An average polynomial algorithm for solving antagonistic games on graphs
- Constraint satisfaction problems over numeric domains
- Cyclical games with prohibitions
- From Parity and Payoff Games to Linear Programming
- A convex programming-based algorithm for mean payoff stochastic games with perfect information
- Tight cyclic game forms
- Cycling in linear programming problems
- A nested family of \(k\)-total effective rewards for positional games
- Stochastic mean payoff games: smoothed analysis and approximation schemes
This page was built for publication: Cyclic games and linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944703)
