Games in oriented matroids
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
|Collections||ANU Research Publications|
|Source:||Journal of Mathematical Economics|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.