| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421373 | Discrete Applied Mathematics | 2008 | 37 Pages |
Abstract
New efficient algorithms for solving infinite-duration two-person adversary games with the decision problem in NP ∩∩ coNP, based on linear programming (LP), LP-representations, combinatorial LP, linear complementarity problem (LCP), controlled LP are surveyed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sergei Vorobyov,