IDEAS home Printed from https://ideas.repec.org/a/gam/jgames/v16y2025i3p29-d1672138.html
   My bibliography  Save this article

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

Author

Listed:
  • Yigal Gerchak

    (Department of Industrial Engineering, Tel Aviv University, Tel-Aviv 69978, Israel)

  • Eugene Khmelnitsky

    (Department of Industrial Engineering, Tel Aviv University, Tel-Aviv 69978, Israel)

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.

Suggested Citation

  • Yigal Gerchak & Eugene Khmelnitsky, 2025. "The Raiffa–Kalai–Smorodinsky Solution as a Mechanism for Dividing the Uncertain Future Profit of a Partnership," Games, MDPI, vol. 16(3), pages 1-13, June.
  • Handle: RePEc:gam:jgames:v:16:y:2025:i:3:p:29-:d:1672138
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2073-4336/16/3/29/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2073-4336/16/3/29/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jgames:v:16:y:2025:i:3:p:29-:d:1672138. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.