A note on determining pure-strategy equilibrium points of bimatrix games

A note on determining pure-strategy equilibrium points of bimatrix games

In this note, we present a linear-time algorithm for determining pure-strategy equilibrium points of bimatrix games. In addition, we show that three mathematical programs are linear-time solvable.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & mathematics with applications (1987) 1996, Vol.32 (7), p.29-35
1. Verfasser: Bai, S.X.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithm
Applied sciences
Bimatrix games
Decision theory. Utility theory
Equilibria
Exact sciences and technology
Game theory
Operational research and scientific management
Operational research. Management science
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this note, we present a linear-time algorithm for determining pure-strategy equilibrium points of bimatrix games. In addition, we show that three mathematical programs are linear-time solvable.
ISSN:0898-1221
1873-7668
DOI:10.1016/0898-1221(96)00153-8