### Abstract

For a new axiomatization, with fewer and weaker assumptions, of binary rank-dependent expected utility of gambles the solution of the functional equation (z/P)γ^{-1}[zγ(p)] = φ^{-1}[φ(z)ψ(p)] (z,p ∈]0,1[) is needed under some monotonicity and surjectivity conditions. We furnish the general such solution and also the solutions under weaker suppositions. In the course of the solution we also determine all sign preserving solutions of the related general equation h(u)[g(u + v)- g(v)} = f(v)g(u + v) (u ∈ ℝ_{+}, v ∈ℝ).

Original language | English |
---|---|

Pages (from-to) | 483-493 |

Number of pages | 11 |

Journal | Proceedings of the American Mathematical Society |

Volume | 129 |

Issue number | 2 |

Publication status | Published - Dec 1 2001 |

### Keywords

- Binary gamble
- Convexity
- Functional equation

### ASJC Scopus subject areas

- Mathematics(all)
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Solution of a functional equation arising in an axiomatization of the utility of binary gambles'. Together they form a unique fingerprint.

## Cite this

Aczél, J., Maksa, G., & Páles, Z. (2001). Solution of a functional equation arising in an axiomatization of the utility of binary gambles.

*Proceedings of the American Mathematical Society*,*129*(2), 483-493.