Template-type: ReDIF-Paper 1.0
Author-Name: Mark Johnson
Author-Email: m.johnson@asu.edu
Author-Homepage: http://wpcarey.asu.edu/Directory/stafffaculty.cfm?cobid=2143748
Author-Workplace-Name: W. P. Carey School of Business Department of Economics
Author-Workplace-Homepage: http://wpcarey.asu.edu/ecn/
Author-Name: Richard Dean
Author-Email: 
Author-Homepage: http://wpcarey.asu.edu/Directory/stafffaculty.cfm?cobid=2145929
Author-Workplace-Name: California Institute of Technology - Department of Mathematics
Author-Workplace-Homepage: 

Title: Designer Path Independent Choice Functions
Abstract: This paper provides a new characterization result for path independent choice functions (PICF) on finite domains and uses that characterization as the basis of an algorithm for the construction of all PICFs on a finite set of alternatives, V, designed by an a priori given set I of initial choices as well as the determination of whether the initial set I is consistent with path independence. The characterization result identifies two properties of a partition of the Boolean algebra as necessary and sufficient for a choice function C to be a PICF: (i): For every subset A of V the set arc(A) = {B: C (B) = C(A)} is an interval in the Boolean algebra 2v. (ii): If A/B is an interval in the Boolean algebra such that C(A) = C(B) and if M/N is an upper transpose of A/B then C(M) = C(N). The algorithm proceeds by expanding on the implications of these two properties.		
Classification-JEL: 
Keywords: 
File-URL:http://wpcarey.asu.edu/tools/mytools/pubs_admin/FILES/DesignPICF.pdf
File-Format: pdf
File-Restriction:
File-Function:
File-Size:
Handle: RePec:asu:wpaper:2145927