Abstract. We define and discuss Savage games, which are ordinal games that are 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, prob- abilities and payoffs. Players’...

An F-cone is a pointed and generating convex cone of a real vector space that is the union of a countable family of finite dimensional polyedral convex cones such that each of which is an extremel subset of the subsequent one. In this paper, we study securities markets with countably many...

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 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 a theorem on the existence of general equilibrium for a production economy with unordered preferences in a topological vector lattice commodity space. Our consumption sets need not have a lower bound and the set of feasible allocations need not be topologically bounded. Furthermore, we...

We consider production economies with unordered preferences and general consumption sets in a vector lattice commodity space. We show, by adapting the approach of Richard (1989), that Edgeworth equilibria can be supported as pseudo-equilibria by continuous prices.