Equilibrium Points in Bimatrix Games

Nikolay Nikolayevich Vorob'ev

99 citations0/0 files storedTheory of Probability and Its Applications

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Game Theory and Applications Complexity and Algorithms in Graphs Game Theory and Voting Systems

Abstract

An algorithm for computing all equilibrium points (situations) for the case of bimatrix (i.e., finite two-person, non-cooperative, non-zero-sum) games is given.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 99 citations exist upstream.

References

1951Non-Cooperative Games 1955Theory of Games and Statistical Decisions.

Cited by

1971On a Generalization of the Lemke–Howson Algorithm to Noncooperative N -Person Games 2010Action-Graph Games 1972An Overview of the Mathematical Theory of Games 2002Chapter 45 Computing equilibria for two-person games 2007Equilibrium Computation for Two-Player Games in Strategic and Extensive Form 2003Solving three-player games by the matrix approach with application to an electric power market 1981Maximal nash subsets for bimatrix games 1999New Maximal Numbers of Equilibria in Bimatrix Games

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.