On Lemke processibility of LCP formulations for solving discounted switching control stochastic games

N. Krishnamurthy () and S. K. Neogy ()
Additional contact information
N. Krishnamurthy: Indian Institute of Management (IIM) Indore
S. K. Neogy: Indian Statistical Institute, Delhi Centre

Annals of Operations Research, 2020, vol. 295, issue 2, No 6, 633-644

Abstract: Abstract Schultz (J Optim Theory Appl 73(1):89–99, 1992) formulated 2-person, zero-sum, discounted switching control stochastic games as a linear complementarity problem (LCP) and discussed computational results. It remained open to prove or disprove Lemke-processibility of this LCP. We settle this question by providing a counter example to show that Lemke’s algorithm does not always successfully process this LCP.We propose a new LCP formulation with the aim of making the underlying matrix belong to the classes R $$_{0}$$ 0 and E $$_{0}$$ 0 , which would imply Lemke processibility. While the underlying matrix in the new formulation is not $$E_0$$ E 0 , we show that it is an R $$_{0}$$ 0 -matrix. Successful processing of Lemke’s algorithm depends on the choice of the initial vector d. Because of the special structure of the LCP in our context, we may, in fact, be able to find a suitable d such that our LCPs are processible by Lemke’s algorithm. We leave this open.

Keywords: Discounted switching control stochastic games; Linear complementarity problem (LCP); Processibility by Lemke’s algorithm; Secondary ray termination; E $$_{0}$$ 0 property (or the class E $$_{0}$$ 0 ); R $$_{0}$$ 0 property (or the class R $$_{0}$$ 0 ) (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-020-03750-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:295:y:2020:i:2:d:10.1007_s10479-020-03750-1

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-020-03750-1

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().