The set of possible outcomes of a strongly ordinal bimatrix game is studied by imbedding each pair of possible payoffs as a point on the standard two-dimensional integral lattice. In particular, we count the number of different Pareto optimal sets of each cardinality; we establish asymptotic...

Let P_{r} denote the convex hull of the integer points in the disc of radius r. We prove that the number of vertices of P_{r} is essentially r^{2/3} as r approaches infinity.

The main result of this paper is that given n red, n white, and n green points in the plane, it is possible to form n vertex-disjoint triangles Delta_{1},...,Delta_{n} in such a way that the Delta_{i} has one red, one white, and one green vertex for every i = 1,...,n and the intersection of...

Let A be a fixed integer matrix of size m by n and consider all b for which the body is full dimensional. We examine the set of shortest non-zero integral vectors with respect to the family of norms. We show that the number of such shortest vectors is polynomial in the bit size of A, for fixed...

The paper, prepared for a Roundtable on Major Economic Problems in the U.S. and the U.S.S.R., discusses some aspects of price theory ñ in particular, the theory of general equilibrium -ñ which may offer some theoretical insights about the economic problems to be encountered during the...

Given a_{1}; a_{2},...a_{n} in Z^{d}, we examine the set, G, of all nonnegative integer combinations of these ai. In particular, we examine the generating function f(z) = Sum_{b in G}z^{b}. We prove that one can write this generating function as a rational function using the neighborhood complex...

Inventory models customarily assume that demand is fully satisfied if sufficient stock is available. We analyze the form of the optimal inventory policy if the inventory manager can choose to meet a fraction of the demand. Under classical conditions we show that the optimal policy is again of...