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

This paper introduces a method of optimization in infinite-horizon economies based on the theory of correspondences. The proposed approach allow us to study time-separable and non-time-separable dynamic economic models without resorting to fixed point theorems or transversality conditions. When...