Abstract
We characterize the single-crossing random utility model (SCRUM) (Apesteguia et al. (2017)) restricted to the (experimentally and empirically) important domain of binary choice menus. As corollaries we characterize some important subclasses of SCRUM (such as single-peaked and single-dipped random utility models) on this domain. In doing so, we address instances of the (still unsolved) binary random utility problem, which asks under what conditions there is a random utility model consistent with data from binary menus.
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.
