All strictly monotonie solutions of a general functional equation are determined. In a particular case, which plays an essential role in the axiomatization of rank-dependent expected utility, all nonnegative solutions are obtained without any regularity conditions. An unexpected possibility of reduction to convexity makes the present proof possible.
- Binary gamble
- Functional equation
- Rank-dependent expected utility
ASJC Scopus subject areas
- Applied Mathematics