Skip to main content
SpringerLink
Log in

Linear Programming Polytope and Algorithm for Mean Payoff Games

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2006)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4041))

Included in the following conference series:

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.

Research supported by the grants from the Swedish Scientific Council and the Foundation for International Cooperation in Research and Higher Education.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Björklund, H., Nilsson, O., Svensson, O., Vorobyov, S.: Controlled linear programming: Boundedness and duality. Technical Report DIMACS-2004-56, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ (December 2004), http://dimacs.rutgers.edu/TechnicalReports/

  2. Björklund, H., Nilsson, O., Svensson, O., Vorobyov, S.: The controlled linear programming problem. Technical Report DIMACS-2004-41, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ (September 2004)

    Google Scholar 

  3. Björklund, H., Svensson, O., Vorobyov, S.: Controlled linear programming for infinite games. Technical Report DIMACS-2005-13, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ (April 2005)

    Google Scholar 

  4. Björklund, H., Svensson, O., Vorobyov, S.: Linear complementarity algorithms for mean payoff games. Technical Report DIMACS-2005-05, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ (February 2005)

    Google Scholar 

  5. Björklund, H., Vorobyov, S.: Combinatorial structure and randomized subexponential algorithms for infinite games. Theoretical Computer Science 349(3), 347–360 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Björklund, H., Vorobyov, S.: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games. Discrete Applied Mathematics (accepted, 2006); Preliminary version in: MFCS 2004. LNCS, vol. 3153, pp. 673–685. Springer, Heidelberg (to appear, 2004) DIMACS TR 2004-05

    Google Scholar 

  7. Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, London (1992)

    MATH  Google Scholar 

  8. Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. International Journ. of Game Theory 8, 109–113 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  9. Gurvich, V.A., Karzanov, A.V., Khachiyan, L.G.: Cyclic games and an algorithm to find minimax cycle means in directed graphs. U.S.S.R. Computational Mathematics and Mathematical Physics 28(5), 85–91 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  10. Murty, K.G., Yu, F.-T.: Linear Complementarity, Linear and Nonlinear Programming. Heldermann Verlag, Berlin (1988)

    MATH  Google Scholar 

  11. Pisaruk, N.: Mean cost cyclical games. Mathematics of Operations Research 24(4), 817–828 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1986)

    MATH  Google Scholar 

  13. Schrijver, A.: Combinatorial Optimization, vol. 1-3. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  14. Svensson, O., Vorobyov, S.: A subexponential algorithm for a subclass of P-matrix generalized linear complementarity problems. Technical Report DIMACS-2005-20, DIMACS: Center for Discrete Mathematics and Theoretical Computer Science, Rutgers University, NJ (June 2005)

    Google Scholar 

  15. Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158, 343–359 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IDSIA, Istituto Dalle Molle di Studi sull’Intelligenza Artificiale, Lugano, Switzerland

    Ola Svensson

  2. Information Technology Department, Uppsala University, Sweden

    Sergei Vorobyov

Authors
  1. Ola Svensson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergei Vorobyov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Clear Water Bay, Hong Kong University of Science and Technology, Hong Kong, China

    Siu-Wing Cheng

  2. Department of Computer Science, City University of Hong Kong,  

    Chung Keung Poon

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Svensson, O., Vorobyov, S. (2006). Linear Programming Polytope and Algorithm for Mean Payoff Games. In: Cheng, SW., Poon, C.K. (eds) Algorithmic Aspects in Information and Management. AAIM 2006. Lecture Notes in Computer Science, vol 4041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775096_8

Download citation

  • DOI: https://doi.org/10.1007/11775096_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35157-3

  • Online ISBN: 978-3-540-35158-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation