Path independence and choice acyclicity property

dc.contributor.author	Lahiri, Somdeb
dc.date.accessioned	2018-03-06T06:01:10Z
dc.date.available	2018-03-06T06:01:10Z
dc.date.issued	1998-08-01
dc.identifier.uri	http://hdl.handle.net/11718/20462
dc.description.abstract	In 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.iso	en_US	en_US
dc.publisher	Indian Institute of Management Ahmedabad	en_US
dc.relation.ispartofseries	WP;1468
dc.subject	Choice function	en_US
dc.title	Path independence and choice acyclicity property	en_US
dc.type	Working Paper	en_US