Abstract
We introduce a combinatorial abstraction of two person finite games in an oriented matroid. We also define a combinatorial version of Nash equilibrium and prove that an odd number of equilibria exists. The proof is a purely combinatorial rendition of the Lemke-Howson algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 807-821 |
| Number of pages | 15 |
| Journal | Journal of Mathematical Economics |
| Volume | 44 |
| Issue number | 7-8 |
| DOIs | |
| Publication status | Published - Jul 2008 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Games in oriented matroids'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver