Games in oriented matroids

Andrew McLennan, Rabee Tourky*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)807-821
Number of pages15
JournalJournal of Mathematical Economics
Volume44
Issue number7-8
DOIs
Publication statusPublished - Jul 2008
Externally publishedYes

Fingerprint

Dive into the research topics of 'Games in oriented matroids'. Together they form a unique fingerprint.

Cite this