We define and discuss Savage games, which are ordinal games of incomplete information set in L. J. Savage's framework of purely subjective uncertainty. Every Bayesian game is ordinally equivalent to a Savage game. However, Savage games are free of priors, probabilities and payoffs. Players'...

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

We prove Aliprantis, Brown, and Burkinshaw's (1987) theorem on the equivalence of Edgeworth production equilibria and pseudo-equilibria in a more general setting. We consider production economies with unordered preferences and general consumption sets in a vector lattice commodity space. We...

We define and discuss Savage games, which are ordinal games of incomplete information set in L. J. Savage's framework of purely subjective uncertainty. Every Bayesian game is ordinally equivalent to a Savage game. However, Savage games are free of priors, probabilities and payoffs. Players'...