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.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Department of Economics, W. P. Carey School of Business, Arizona State University in its series Working Papers with number
2145927.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: