Abstract
A simple choice experiment is one in which a subject is asked to select among several alternatives according to some specified criterion, and a ranking experiment is one in which he is asked to rank order the alternatives, again according to some specified criterion. When decisions are governed by a probabilistic process, various connections are possible between simple choice and ranking behavior. In this paper we consider a set of conditions that assumes that the ranking probabilities can be expressed as a “natural” function of the simple choice probabilities. Under these conditions the binary choice probabilities on a finite set A determine the simple choice and ranking probabilities on every subset of A, and explicit forms are given for the functions relating the simple choice and ranking probabilities to the binary choice probabilities.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
