Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/20462
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLahiri, Somdeb-
dc.date.accessioned2018-03-06T06:01:10Z-
dc.date.available2018-03-06T06:01:10Z-
dc.date.issued1998-08-01-
dc.identifier.urihttp://hdl.handle.net/11718/20462-
dc.description.abstractIn this paper we study lower and upper approximations of choice functions and propose a necessary and sufficient condition for a choice function to have a path independent lower approximation. In an appendix to this paper we provide a simple proof of Theorem 2.10 in Deb (1983) in the case when the universal set is finite. In a final section of this paper, we characterize all batch choice functions using a choice acyclicity property.en_US
dc.language.isoen_USen_US
dc.publisherIndian Institute of Management Ahmedabaden_US
dc.relation.ispartofseriesWP;1468-
dc.subjectChoice functionen_US
dc.titlePath independence and choice acyclicity propertyen_US
dc.typeWorking Paperen_US
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1998_1468.pdfWP_1998_1468615.47 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.