The Raiffa–Kalai–Smorodinsky Solution as a Mechanism for Dividing the Uncertain Future Profit of a Partnership

Yigal Gerchak, Eugene Khmelnitsky

Research output: Contribution to journalArticlepeer-review

Abstract

Establishing a partnership necessitates agreeing on how to divide future profits or losses. We consider parties who wish to contract on the division of uncertain future profits. We propose to divide profits according to the Raiffa–Kalai–Smorodinsky (K-S) solution, which is the intersection point of the feasible region’s boundary and the line connecting the disagreement and ideal points. It is the only function which satisfies invariance to linear transformations, symmetry, strong Pareto optimality, and monotonicity. We formulate the general problem of designing a contract which divides uncertain future profit between the partners and determines shares of each partner. We first focus on linear and, later, non-linear contracts between two partners, providing analytical and numerical solutions for various special cases in terms of the utility functions of the partners, their beliefs, and the disagreement point. We then generalize the analysis to any number of partners. We also consider a contract which is partially based on the parties’ financial contribution to the partnership, which have a positive impact on profit. Finally, we address asymmetric K-S solutions. K-S solutions are seen to be a useful predictor of the outcome of negotiations, similar to Nash’s bargaining solution.

Original languageEnglish
Article number29
JournalGames
Volume16
Issue number3
DOIs
StatePublished - Jun 2025

Keywords

  • bargaining
  • linear and non-linear contract
  • profit sharing
  • risk-aversion

All Science Journal Classification (ASJC) codes

  • Statistics and Probability
  • Statistics, Probability and Uncertainty
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The Raiffa–Kalai–Smorodinsky Solution as a Mechanism for Dividing the Uncertain Future Profit of a Partnership'. Together they form a unique fingerprint.

Cite this