In this paper it is shown how to compute stable sets, defined by Mertens (1989), inthe context of bimatrix games only using linear optimization techniques.

AMS classifications: 05E30; 51E12

AMS classifications: 05E30; 05B20; 94B05

AMS classifications; 05C50; 05E30;

In this and a sequel paper [10] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize 2-(v, k, É) designs, and include partial geometric designs and uniform multiplicative designs.Here we study the latter, which are precisely the nonsingular...

AMS classifications: 05E30; 51E20; 94B05;

In this paper we introduce a model of an exchange economy with indivisible goods and money.There are nitely many agents each of whom owns one unit of each of nitely many di erent types of indivisible goods and certain amount of money. Each type of indivisible good is subject to quality di...

In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize (v, k, ë) designs, and include uniform multiplicative designs and partial geometric designs.Here we study the latter, which are precisely the designs with...