On Lemke processibility of LCP formulations for solving discounted switching control stochastic games (Q828828)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Lemke processibility of LCP formulations for solving discounted switching control stochastic games |
scientific article; zbMATH DE number 7344047
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Lemke processibility of LCP formulations for solving discounted switching control stochastic games |
scientific article; zbMATH DE number 7344047 |
Statements
On Lemke processibility of LCP formulations for solving discounted switching control stochastic games (English)
0 references
5 May 2021
0 references
discounted switching control stochastic games
0 references
linear complementarity problem (LCP)
0 references
processibility by Lemke's algorithm
0 references
secondary ray termination
0 references
\(E_0\) property (or the class \(E_0\))
0 references
\(R_0\) property (or the class \(R_0\))
0 references
0 references
0 references
0 references
0 references
0.8703932762145996
0 references
0.8277370929718018
0 references
0.7776265144348145
0 references
0.7738420963287354
0 references
