The purpose of this paper is to prove by induction the theorem (in Aizerman and Malishevski [1981]) that a choice function which satisfies Chernoffs axiom and Outcasting can always by expressed as the union of the solution sets of a finite number of maximization problems. In this paper we also show that the Slater solution for abstract games (see Slater [1961]) satisfies the Chernoff, Outcasting and Expansion axioms. On the other hand the solution due to Copeland [1951], which has subsequently been axiomatically characterized Henriet [1985], does not satisfy any of these three properties.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Indian Institute of Management Ahmedabad, Research and Publication Department in its series IIMA Working Papers with number
2000-03-02.