Consequence of chernoff and outcasting and solutions for abstract games

IIMA Institutional Repository

Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/775

Full metadata record

DC Field	Value	Language
dc.contributor.author	Lahiri, Somdeb	-
dc.date.accessioned	2010-01-16T11:20:08Z	-
dc.date.available	2010-01-16T11:20:08Z	-
dc.date.copyright	2000-03	-
dc.date.issued	2010-01-16T11:20:08Z	-
dc.identifier.uri	http://hdl.handle.net/11718/775	-
dc.description.abstract	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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;2000-03-02/1582	-
dc.subject	Abstract games	en
dc.title	Consequence of chernoff and outcasting and solutions for abstract games	en
dc.type	Working Paper	en
Appears in Collections:	Working Papers

Files in This Item:

File	Description	Size	Format
WP 2000_1582.pdf		660.48 kB	Adobe PDF	View/Open