Abstract
We provide a revealed preference characterization of expected utility maximization in binary lotteries with prize-probability trade-offs. We start by characterizing optimizing behavior when the empirical analyst exactly knows the utility function or the probability function of winning. Next, we consider the situation with both the probability function and the utility function unknown. In this case utility maximization has empirical content when imposing the mild shape restriction that at least one of these functions is log-concave.
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.
