IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v35y2018i05ns0217595918500355.html
   My bibliography  Save this article

On Solving Mean Payoff Games Using Pivoting Algorithms

Author

Listed:
  • S. K. Neogy

    (Indian Statistical Institute, Delhi Center, New Delhi 110016, India)

  • Prasenjit Mondal

    (Mathematics Department, Government General Degree College, Ranibandh, Bankura 722135, India)

  • Abhijit Gupta

    (Indian Statistical Institute, Kolkata Center, Kolkata 700108, India)

  • Debasish Ghorui

    (Mathematics Department, Jadavpur University, Kolkata 700032, India)

Abstract

Two classical pivoting algorithms, due to Lemke and Cottle–Dantzig, are studied on linear complementarity problems (LCPs) and their generalizations that arise from infinite duration two-person mean payoff games (MPGs) under zero-mean partition problem. Lemke’s algorithm was studied in solving MPGs via reduction to discounted payoff games or to simple stochastic games. We provide an alternative and efficient approach for studying the LCPs arising from the MPGs without any reduction. A binary MPG can easily be formulated as an LCP which has always terminated in a complementary solution in numerical experiments, but has not yet been proven either the processability of MPG’s by Lemke’s algorithm or a counter example that it will not terminate with a solution. Till now, the processability of MPG’s by Lemke’s algorithm remains open. A general MPG (with arbitrary outgoing arcs) naturally reduces to a generalized linear complementarity problem (GLCP) involving a rectangular matrix where the vertices are represented by the columns and the outgoing arcs from each vertex are represented by rows in a particular block. The noteworthy result in this paper is that the GLCP obtained from an MPG is processable by Cottle–Dantzig principal pivoting algorithm which terminates with a solution. Several properties of the matrix which arise in this context are also discussed.

Suggested Citation

  • S. K. Neogy & Prasenjit Mondal & Abhijit Gupta & Debasish Ghorui, 2018. "On Solving Mean Payoff Games Using Pivoting Algorithms," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-26, October.
    • Handle: RePEc:wsi:apjorx:v:35:y:2018:i:05:n:s0217595918500355
    DOI: 10.1142/S0217595918500355
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595918500355
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595918500355?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. S. R. Mohan & S. K. Neogy & T. Parthasarathy, 2001. "Pivoting Algorithms For Some Classes Of Stochastic Games: A Survey," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 3(02n03), pages 253-281.
    2. C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
    3. N. N. Pisaruk, 1999. "Mean Cost Cyclical Games," Mathematics of Operations Research, INFORMS, vol. 24(4), pages 817-828, November.
    4. A. J. Hoffman & R. M. Karp, 1966. "On Nonterminating Stochastic Games," Management Science, INFORMS, vol. 12(5), pages 359-370, January.
    5. M. Seetharama Gowda & Jong-Shi Pang, 1992. "On Solution Stability of the Linear Complementarity Problem," Mathematics of Operations Research, INFORMS, vol. 17(1), pages 77-83, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Prasenjit Mondal, 2018. "Completely mixed strategies for single controller unichain semi-Markov games with undiscounted payoffs," Operational Research, Springer, vol. 18(2), pages 451-468, July.
    2. N. Krishnamurthy & S. K. Neogy, 2020. "On Lemke processibility of LCP formulations for solving discounted switching control stochastic games," Annals of Operations Research, Springer, vol. 295(2), pages 633-644, December.
    3. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Computing Integral Solutions of Complementarity Problems," Discussion Paper 2005-5, Tilburg University, Center for Economic Research.
    4. R. B. Bapat & S. K. Neogy, 2016. "On a quadratic programming problem involving distances in trees," Annals of Operations Research, Springer, vol. 243(1), pages 365-373, August.
    5. Rahul Savani & Bernhard von Stengel, 2016. "Unit vector games," International Journal of Economic Theory, The International Society for Economic Theory, vol. 12(1), pages 7-27, March.
    6. S. R. Mohan, 1997. "Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule," Journal of Optimization Theory and Applications, Springer, vol. 94(2), pages 409-423, August.
    7. Christian Bidard, 2010. "Complementarity Problems and General Equilibrium," Working Papers hal-04140923, HAL.
    8. van der Laan, G. & Talman, A.J.J. & Yang, Z.F., 2005. "Solving Discrete Zero Point Problems with Vector Labeling," Other publications TiSEM 9bd940ee-3fe6-4201-aede-7, Tilburg University, School of Economics and Management.
    9. Hanna Sumita & Naonori Kakimura & Kazuhisa Makino, 2015. "The Linear Complementarity Problems with a Few Variables per Constraint," Mathematics of Operations Research, INFORMS, vol. 40(4), pages 1015-1026, October.
    10. K. Ahmad & K. R. Kazmi & N. Rehman, 1997. "Fixed-Point Technique for Implicit Complementarity Problem in Hilbert Lattice," Journal of Optimization Theory and Applications, Springer, vol. 93(1), pages 67-72, April.
    11. Hanna Sumita & Naonori Kakimura & Kazuhisa Makino, 2019. "Total dual integrality of the linear complementarity problem," Annals of Operations Research, Springer, vol. 274(1), pages 531-553, March.
    12. Endre Boros & Khaled Elbassioni & Vladimir Gurvich & Kazuhisa Makino, 2013. "On Canonical Forms for Zero-Sum Stochastic Mean Payoff Games," Dynamic Games and Applications, Springer, vol. 3(2), pages 128-161, June.
    13. Jugal Garg & Ruta Mehta & Vijay V. Vaziranic, 2018. "Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 996-1024, August.
    14. Christian Bidard, 2014. "The Ricardian rent theory two centuries after," Working Papers hal-04141289, HAL.
    15. Zheng-Hai Huang & Liqun Qi, 2019. "Tensor Complementarity Problems—Part III: Applications," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 771-791, December.
    16. Zijun Hao & Chieu Thanh Nguyen & Jein-Shan Chen, 2022. "An approximate lower order penalty approach for solving second-order cone linear complementarity problems," Journal of Global Optimization, Springer, vol. 83(4), pages 671-697, August.
    17. Dipti Dubey & S. K. Neogy & Debasish Ghorui, 2017. "Completely Mixed Strategies for Generalized Bimatrix and Switching Controller Stochastic Game," Dynamic Games and Applications, Springer, vol. 7(4), pages 535-554, December.
    18. M. Seetharama Gowda, 2019. "Weighted LCPs and interior point systems for copositive linear transformations on Euclidean Jordan algebras," Journal of Global Optimization, Springer, vol. 74(2), pages 285-295, June.
    19. Christian Bidard, 2015. "An oddity property for cross-dual games," Working Papers hal-04141427, HAL.
    20. Senlai Zhu & Jie Ma & Tianpei Tang & Quan Shi, 2020. "A Combined Modal and Route Choice Behavioral Complementarity Equilibrium Model with Users of Vehicles and Electric Bicycles," IJERPH, MDPI, vol. 17(10), pages 1-18, May.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wsi:apjorx:v:35:y:2018:i:05:n:s0217595918500355. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.