Cyclic games and linear programming
type: Item
instance of: scholarly article
title: Cyclic games and linear programming
zbMATH Open document ID: 1142.91310
author: Sergei Vorobyov
published in: Discrete Applied Mathematics
publication date: 2008-09-10T00:00:00Z
Mathematics Subject Classification ID: 91A05
Mathematics Subject Classification ID: 91A15
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5324132
zbMATH Keywords: mean payoff
zbMATH Keywords: simple stochastic
zbMATH Keywords: parity
zbMATH Keywords: discounted payoff games
zbMATH Keywords: longest-shortest paths
zbMATH Keywords: generalized linear complementarity
zbMATH Keywords: controlled linear programming
zbMATH Keywords: combinatorial linear programming
zbMATH Keywords: subexponential algorithms
zbMATH Keywords: iterative improvement
zbMATH Keywords: local search
MaRDI profile type: Publication
full work available at URL: j.dam.2008.04.012
OpenAlex ID: W1999183059
cites work: Q4418690
cites work: Memoryless determinacy of parity and mean payoff games: a simple proof
cites work: Combinatorial structure and randomized subexponential algorithms for infinite games
cites work: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
cites work: The complexity of stochastic games
cites work: A generalization of the linear complementarity problem
cites work: Q4003375
cites work: The P-matrix problem is co-NP-complete
cites work: The generalized linear complementarity problem: Least element theory and Z-matrices
cites work: Positional strategies for mean payoff games
cites work: Q4353562
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Fundamentals of Computation Theory
cites work: Q3245641
cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs
cites work: From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
cites work: On Nonterminating Stochastic Games
cites work: Shortest-path network interdiction
cites work: A deterministic subexponential algorithm for solving parity games
cites work: Linear programming, the simplex algorithm and simple polytopes
cites work: Cyclical games with prohibitions
cites work: On short paths interdiction problems: Total and node-wise limited interdiction
cites work: Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: A subexponential bound for linear programming
cites work: Randomized pivot algorithms for \(P\)-matrix linear complementarity problems
cites work: Extensions of two person zero sum games
cites work: Q4117607
cites work: Q4039868
cites work: Mean cost cyclical games
cites work: Q3818127
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Stochastic Games
cites work: Linear Programming Polytope and Algorithm for Mean Payoff Games
cites work: Existence and uniqueness of solutions for the generalized linear complementarity problem
cites work: Completely unimodal numberings of a simple polytope
cites work: The complexity of mean payoff games on graphs
DOI: 10.1016/J.DAM.2008.04.012
description: scientific article; zbMATH DE number 5324132