Topic
Lemke's algorithm
About: Lemke's algorithm is a research topic. Over the lifetime, 303 publications have been published within this topic receiving 12384 citations.
Papers published on a yearly basis
Papers
Book•
18 Feb 1992
TL;DR: In this article, the authors present an overview of existing and multiplicity of degree theory and propose pivoting methods and iterative methods for degree analysis, including sensitivity and stability analysis.
Abstract: Introduction. Background. Existence and Multiplicity. Pivoting Methods. Iterative Methods. Geometry and Degree Theory. Sensitivity and Stability Analysis. Chapter Notes and References. Bibliography. Index.
3,025 citations
1 Jan 2009
TL;DR: An article holding receptacle, such as an expandable envelope, is releasably secured to the steering column of an automotive vehicle by means of an elasticized band wrapped partly around the steering Column hooked at both ends to a clip from which the envelope is rele asably attached.
Abstract: An article holding receptacle, such as an expandable envelope, is releasably secured to the steering column of an automotive vehicle by means of an elasticized band wrapped partly around the steering column hooked at both ends to a clip from which the envelope is releasably attached. The length of the band is such that, when engaged at its ends with the clip, it is under sufficient tension to be retained snugly against the steering column. The envelope is secured to the clip by releasable means such as a paper fastener and includes means to prevent skewing of the envelope about the fastener.
1,458 citations
TL;DR: An algebraic proof of the existence of equilibrium points for two-person non-zero-sum games is given in this paper, leading to an efficient scheme for computing an equilibrium point, which is valid for any ordered field.
Abstract: An algebraic proof is given of the existence of equilibrium points for bimatrix (or two-person, non-zero-sum) games. The proof is constructive, leading to an efficient scheme for computing an equilibrium point. In a nondegenerate case, the number of equilibrium points is finite and odd. The proof is valid for any ordered field.
1,243 citations
TL;DR: In this paper, simple constructive proofs are given of solutions to the matric matric system Mz − ω = q; z ≧ 0; ω ≧ 1; zT = 0, for various kinds of data M, q, which embrace quadratic programming and the problem of finding equilibrium points of bimatrix games.
Abstract: Some simple constructive proofs are given of solutions to the matric system Mz − ω = q; z ≧ 0; ω ≧ 0; and zT ω = 0, for various kinds of data M, q, which embrace the quadratic programming problem and the problem of finding equilibrium points of bimatrix games. The general scheme is, assuming non-degeneracy, to generate an adjacent extreme point path leading to a solution. The scheme does not require that some functional be reduced.
1,032 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 2018 | 5 |
| 2017 | 6 |
| 2016 | 9 |
| 2015 | 2 |
| 2014 | 4 |