Title of article :
Cyclic games and linear programming Original Research Article
Author/Authors :
Sergei Vorobyov، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2008
Abstract :
New efficient algorithms for solving infinite-duration two-person adversary games with the decision problem in NP image coNP, based on linear programming (LP), LP-representations, combinatorial LP, linear complementarity problem (LCP), controlled LP are surveyed.
Keywords :
Longest–shortest paths , Controlled linear programming , Combinatorial linear programming , Subexponential algorithms , Iterative improvement , Mean payoff , Discounted payoff games , Local search , Simple stochastic , Parity , Generalized linear complementarity
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
