Skip to main content
Conference Proceedings

Linear programming polytope and algorithm for mean payoff games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4041 LNCS 64-78
DOI: 10.1007/11775096_8
N/ACitations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We investigate LP-polytopes generated by mean payoff games and their properties, including the existence of tight feasible solutions of bounded size. We suggest a new associated algorithm solving a linear program and transforming its solution into a solution of the game. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Svensson, O., & Vorobyov, S. (2006). Linear programming polytope and algorithm for mean payoff games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4041 LNCS, pp. 64–78). Springer Verlag. https://doi.org/10.1007/11775096_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free