Uncovered choice functions

IIMA Institutional Repository

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Lahiri, Somdeb	-
dc.date.accessioned	2010-01-16T11:05:29Z	-
dc.date.available	2010-01-16T11:05:29Z	-
dc.date.copyright	2000-01	-
dc.date.issued	2010-01-16T11:05:29Z	-
dc.identifier.uri	http://hdl.handle.net/11718/763	-
dc.description.abstract	An abiding problem in choice theory has been one of characterizing those choice function which are obtained as a result of some kind of optimization. Specifically, the endeavour has concentrated largely on finding a binary relation (if there be any) whose best elements coincide with observed choices. An adequate survey of this line of research till the mid eighties is available in Moulin [1985]. More recently, the emphasis has focused on binary relations defined on non-empty subsets of a given set, such that the choice function coincides with the best subset corresponding to a feasible set of alternatives. This problem has been provided with a solution in Lahiri (Forthcoming), although the idea of binary relations defined on subsets is a concept which owes its analytical origins to Pattanaik and Xu [1990].	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;2000-01-04/1574	-
dc.subject	Choice theory	en
dc.title	Uncovered choice functions	en
dc.type	Working Paper	en
Appears in Collections:	Working Papers

Files in This Item:

File	Description	Size	Format
WP 2000_1574.pdf		431.74 kB	Adobe PDF	View/Open