Next Article in Journal
Equilibrium Coalition Structures in Three-Player Symmetric Games
Previous Article in Journal
The Impact of Gifts and Shared Experiences on an Investor-Manager Relationship
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

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

Department of Industrial Engineering, Tel Aviv University, Tel-Aviv 69978, Israel
*
Author to whom correspondence should be addressed.
Games 2025, 16(3), 29; https://doi.org/10.3390/g16030029
Submission received: 26 February 2025 / Revised: 4 May 2025 / Accepted: 9 May 2025 / Published: 4 June 2025

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.

1. Introduction

A partnership is an arrangement in which several individuals cooperate to advance their mutual interests and share the profits and liabilities of, say, a business venture. In a broad sense, it is any cooperative endeavor undertaken by multiple parties. These parties can be governments, non-profits, businesses, individuals, or a combination. Partnerships are widespread in common law jurisdictions such as the United States, Great Britain, and the Commonwealth, especially in professional service industries. Examples also include a law firm, as well as performers and their managers/agents. If professionals have similar skills (e.g., lawyers, physicians), the motivations of creating a partnership are risk-sharing and economies of scale. If they possess complementary skills, they wish to provide a more complete service.
Parties who are considering creating a partnership need to decide in advance how to divide uncertain future profits (or losses). In some situations, the division may be based on initial investment or number of clients each brings. We shall, however, initially consider partnerships without an initial contribution of resources. This problem was discussed by Wilson (1968) and Levin and Tadelis (2005) in the context of the Nash Bargaining Solution. Recently Gerchak and Khmelnitsky (2019a, 2019b) approached the problem explicitly allowing for different risk attitudes and beliefs, in two different ways. In Gerchak and Khmelnitsky (2019b), somewhat similarly to Wilson (1968), they assumed that one of the partners, who knows the other’s risk attitude and beliefs, proposes a contract to the other, respecting its individual rationality constraint (“Leader-Follower”, LF approach). In Gerchak and Khmelnitsky (2019a), profit was split such that the product of expected utilities (net of expected utilities of disagreement point) was maximized, that is, by the Nash Bargaining Solution (NBS) (Nash, 1953).
The problem of profit sharing in partnerships is studied in various applications in economics, business management, industrial relations, and other fields as it affects incentives, cooperation, risk-sharing, and efficiency of/among the partners. Such applications explore how profit-sharing rules (equal, performance-based, contribution-based, etc.) influence outcomes like business success, partner satisfaction, and fairness perception (see, e.g., Gerchak & Khmelnitsky, 2021). In startups, law firms, consulting firms, medical practices, and joint ventures, how profits are shared can make the difference in the partnership’s outcome.
This article assumes that the profit is split via the Raiffa–Kalai–Smorodinsky (K-S) solution (Gerchak & Khmelnitsky, 2021; Kalai & Smorodinsky, 1975), which is the intersection point of the boundary of the feasible region and a line connecting the disagreement point and the ideal point. The K-S solution is the only function which satisfies the following: invariance to affine transformation, symmetry, strong Pareto optimality, and monotonicity (Kalai & Smorodinsky, 1975). In our setting, the ideal point consists of expected utilities of the entire profit allocated to one partner.
Compared to NBS and other profit-sharing mechanisms, the K-S provides solutions which preserve proportional ratios of gains (rather than maximize product of utility gains as in the NBS approach), resulting in being less sensitive to scaling and risk attitudes issues. The K-S approach avoids outcomes where a stronger party can “crush” the other just because it is better at bargaining; instead, each party’s best-case scenario is respected proportionally. Using the K–S solution can help create agreements that feel fair based on relative expectations often important when long-term cooperation and perceived fairness matter.
Compared to the “Leader–Follower” approach in profit sharing (Gerchak & Khmelnitsky, 2019b), where one party (the leader) moves first, deciding on a profit-sharing rule, contribution level, or other key terms, and the other party (the follower) then reacts optimally to the leader’s choice, the K-S solution does not assume asymmetry in information that leads, as a result, to balanced and fair profit shares for all partners.
After formulating the problem (Section 2), we consider two-partner linear contracts (Section 3), analyzing various special cases. We then extend the analysis to any number of partners (Section 4). Section 5 and Section 6 consider extensions of the two-partner model to cases with non-zero disagreement points and with non-linear contracts, respectively. Section 7 and Section 8 deal with an asymmetric contract formulation and a formulation with profit allocation that is partially based on relative amounts of initial investments. Section 9 then concludes the paper.

2. Problem Formulation

Let X and x denote random profit and profit value, respectively. Suppose one partner receives r(x), if the realized profit is x, the other partner then receives xr(x). Let u 1 · and u 2 · be the utility functions of partners 1 and 2, respectively. These von Neumann–Morgenstern utility functions are assumed to be increasing, continuous, concave, and almost differentiable everywhere: u i · > 0 ,   u i · 0 ,   i = 1 , 2 (e.g., Muthoo, 1999).
Let φ 1 · and φ 2 · be the pdfs of the profit, which represent the beliefs of partners 1 and 2, respectively; the two functions are defined over a common support:
φ i x > 0 ,   i = 1 , 2   x x 0 ,   x 1 .
The corresponding cdfs are F 1 · and F 2 · . From its definition, the K-S solution is the point closest to the ideal point E 1 u 1 ( X ) ,   E 2 u 2 ( X ) among all feasible points in the expected utilities domain that lie on the line which connects the ideal point and the disagreement point of the partners denoted here by d 1 ,   d 2 . We assume that
0 d 1 < E 1 u 1 ( X ) ,   0 d 2 < E 2 u 2 ( X ) .
The determination of the K-S solution is equivalent to solving the following optimization problem:
max r X E 1 u 1 r ( X )
s.t.
E 1 u 1 X E 1 u 1 r ( X ) E 1 u 1 r ( X ) d 1 = E 2 u 2 X E 2 u 2 X r ( X ) E 2 u 2 X r ( X ) d 2 ,
0 d d x r ( x ) 1
We note that (1)–(3) is not a unique statement of the K-S problem. Another equivalent formulation can be obtained by replacing partner 1’s expected utility by partner 2’s expected utility in objective (1). In general, maximizing any non-negative linear combination of the expected utilities of the two partners would give the same solution. In the following sections, we present closed-form solutions to the optimization problem (1)–(3) where possible and turn to numerical approximations in cases where no analytical solution exists.

3. Linear Contracts

We pay particular attention to affine (“linear”) contracts, r x = p x + K , 0 p 1 , where K is transferred from the other partner, as most contracts used in practice are linear. Further, the accounting literature primarily employs the LEN model, where the contract is linear (Feltham & Xie, 1994). Typical linear contracts are
K , X K ,     p X , 1 p X ,     p X + K , 1 p X K ,     0 p 1 .
Assume, for now, that d 1 = d 2 = 0 . Then, the K-S condition simplifies to
E 1 u 1 X E 1 u 1 r ( X ) = E 2 u 2 X E 2 u 2 X r ( X ) .
Example 1.
Consider risk neutral partners, where u 1 r = u 2 r = r . For a linear contract that satisfies (4), it holds that
K = ( 1 2 p ) E 1 X E 2 X E 1 X + E 2 X .
So, K is decreasing in p , as one would expect. Also, such a linear contract defines the feasible region in the expected utilities domain:
E 1 r X , E 2 X r X = u 1 , u 2 u 2 = u 1 + E 2 X + p E 1 X E 2 X .
The K-S solution, i.e., the point closest to the ideal point u 1 , u 2 = E 1 ( X ) , E 2 ( X ) that satisfies (5) and (6) is as follows:
  • For equal means, E 1 X   =   E 2 X , there are multiple solutions given by
    K = 1 2 p E i X , 0 p 1 , i = 1 , 2 .
So, if partner 1’s share is higher than 1 2 , it has to make a transfer to the other partner.
Since the problem here is max p , K p E 1 X + K , s.t. K = ( 1 2 p ) E 1 X E 2 X E 1 X + E 2 X , then we actually wish to  max p p E 1 X + ( 1 2 p ) E 1 X E 2 X E 1 X + E 2 X .
Since the objective is linear in p with the slope of E 1 X E 1 X E 2 X E 1 X + E 2 X , then
  • For E 1 X > E 2 X , the solution is p = 1 and K = E 1 X E 2 X E 1 X + E 2 X ; i.e., K is negative. (transfer from P1 to P2).
  • For E 1 X < E 2 X , the solution is p = 0 and K = E 1 X E 2 X E 1 X + E 2 X ; i.e., K is positive. (transfer from P2 to P1).
Example 2.
Let K = 0 , i.e., r x = p x ,   φ i x = λ i e λ i x ,   x 0 and u i r = u i 1 e μ i r .   i = 1 , 2 (CARA). Then, the K-S condition reduces to the following quadratic equation:
λ 2 μ 1 λ 1 μ 2 p 2 λ 1 λ 2 + μ 2 1 2 p = 0 .
The unique solution of the latter equation, such that 0 p 1 , is
p = 1 1 + λ 2 λ 1 + μ 1 λ 1 λ 2 + μ 2 .
It can be shown that p is decreasing in μ 1 and increasing in μ 2 . It is increasing in λ 1 and λ 2 iff λ 1 λ 2 < μ 1 μ 2   .   That is, a partner’s share of profit should increase in their own risk aversion and decrease in the other partner’s risk aversion. It is decreasing in the means of both partners’ subjective distributions if  λ 1 λ 2 < μ 1 μ 2 .
Example 3.
Now Let r x = p x + K ,   φ i x = λ i e λ , x and u i r = u i 1 e μ i r ,   i = 1 ,   2 .
Figure 1 presents the feasible region of the expected utilities for the parameters
u 1 = u 2 = 1 ,   λ 1 = 1 ,     λ 2 = 2 ,   μ 1 = 1 ,   μ 2 = 0.2 .
The region is bounded from above and below by the lines presenting the contracts with p = 1 and p = 0 , respectively, where K is free. The dashed line connects the origin with the ideal point shown by the black square and located at (0.5, 0.091). The K-S solution is thus located at the intersection of the dashed line and the upper bound of the feasible region.
An analytic expression for the K-S solution is available for some specific cases. If, for example, μ 1 = μ 2 μ , then the K-S condition results in the following quadratic equation in e K μ :
μ ( u 1 e K μ λ 1 u 1 λ 1 + μ p ) u 2 λ 2 + μ = μ ( u 2 e K μ λ 2 u 2 λ 2 + μ μ p ) u 1 λ 1 + μ ,
for which the only feasible K is
K = 1 μ l n λ 2 λ 1 z 1 z 2 + λ 1 λ 2 z 1 z 2 2 + 4 λ 1 λ 2 λ 1 + μ λ 2 + μ z 1 z 2 2 λ 2 ( λ 2 + μ ) z 1 ,
where z 1 = λ 1 + μ p and z 2 = λ 2 + μ ( 1 p ) . Then, after substituting this expression in the objective, E 1 u 1 r ( X ) , it is maximized as follows:
  • If λ 1 < λ 2 (i.e., E 1 X > E 2 X ) and μ < λ 2 λ 1 , then
    p = 1   and   K = 1 μ l n λ 2 λ 1 + λ 1 + λ 2 2 + 4 λ 1 μ 2 λ 2 + μ ;
  • If λ 2 < λ 1 and μ < λ 1 λ 2 , then
    p = 0   and   K = 1 μ l n λ 2 λ 1 + λ 1 + λ 2 2 + 4 λ 2 μ 2 λ 2 ;
  • Otherwise, if μ λ 1 λ 2 , then
    p = 1 2 + λ 2 λ 1 2 μ
    K = 1 μ l n λ 2 λ 1 z 1 z 2 + λ 1 λ 2 z 1 z 2 2 + 4 λ 1 λ 2 λ 1 + μ λ 2 + μ z 1 z 2 2 λ 2 ( λ 2 + μ ) z 1 .
An illustration of this case is shown in Figure 2.
Another case where an analytic solution can be derived is the limit when   μ 1 0 and λ 1 = λ 2 λ , μ 2 = 1 . In such a case, partner 1’s utility tends to be zero regardless of the contract, and the K-S problem is solved by maximizing the expected utility of partner 2. The solution is p = 1 , with a negative K that solves λ = e K 1 K e K . In the opposite limit case, where μ 2 0 and μ 1 = 1 , the K-S contract is p = 0 with a positive K that solves
λ = e K 1 + K e K .
Example 4.
r x = p x + K , u i r = a + r α i , r > a , 0 < α i < 1 , a 0 , X i ~ U 0 ,   1 , i = 1 ,   2 . For the utility functions to be properly defined for all x 0 , the value of K must be in a , a . The K-S condition (4) here is as follows:
1 p 1 + a 1 + α 2 a 1 + α 2 a + K + p 1 + α 1 a + K 1 + α 1 = p 1 + a 1 + α 1 a 1 + α 1 1 + a K p 1 + α 2 a K 1 + α 2 .
In the limit case where α 1 1 and α 2 0 , multiple solutions of the K-S problem satisfy
K = 1 2 1 p ,         0 p 1 .
In the opposite limit case, where α 1 0 and α 2 1 , multiple solutions of the K-S problem satisfy
K = p 2 ,         0 p 1 .
For both cases, solutions are independent of a. For intermediate values of α 1 and α 2 , a numerical approximation of the unique solution of the K-S problem for a = 2 is shown in Figure 3 and Figure 4. Figure 3 presents the plots of the two contract parameters, p and K, for α 1 [ 0,1 ] , and Figure 4 presents a parametric plot in the (p,K) domain.

4. Multiple Partners

Assume now that more than two risk-neutral partners consider the linear contract r i = p i x + K i , i = 1 , 2 , , n , with
p i 0 ,   i = 1 n p i = 1 ,   i = 1 n K i = 0 .
The partners are assumed to be risk-neutral, u r = r . We seek the K-S solution, which, according to its definition, is the closest to the ideal point E 1 X , ,   E n ( X ) among all feasible points in the expected revenues domain that lie on the line which connects the ideal point and the disagreement point of the partners (in this section d i = 0 ,   i = 1 , 2 , , n ) . Such a line is presented by the following equations:
E i X E i p i X + K i = E j X E j p j X + K j i , j .
The minimization of the distance to the ideal point subject to constraints (7) and (8) is solved via
p i = 1 ,         i f   i = i * 0 ,       o t h e r w i s e
where i * = a r g m a x j E j ( X ) , and
K i = E i * X j = 1 n E j X E i * X j = 1 n E j X ,         i f     i = i * E i X E i * X j = 1 n E j X ,                               o t h e r w i s e .
The expected profit of partner i ,   i i *
J i = p i E i X + K i = E i X E i * X j = 1 n E j X ,
is proportional to both expected revenues of itself and of the most optimistic partner.

4.1. Partnership vs. Working Alone

We now derive conditions under which conducting business in a partnership with n 1 partners has an advantage over conducting business alone. The profit of partner i when working alone is denoted by Y i , and the factor by which the expected profits of the partners grow when working in a partnership of n coworkers is denoted by g ( n ) . That is,
E i X = g ( n ) E ( Y i ) ,   g 1 = 1 .
We assume that g n + 1 g n ,   n 1 , and compare the expected revenue in (9) with E ( Y i ) ,
E i X E i * X j = 1 n E j X > E ( Y i ) .
By substituting the factor g ( n ) in the left-hand side of this inequality, we obtain the following:
g n E Y i g ( n ) E Y i * g ( n ) j = 1 n E Y j > E ( Y i ) .
Equivalently,
g n n E ( Y i ) E ( Y i * ) E ( Y ) ¯ > E ( Y i ) ,
where E ( Y ) ¯ is the average expected revenue, E ( Y ) ¯ = 1 n j = 1 n E ( Y j ) . The last inequality shows that a partnership benefits all partners if g n n > E ( Y ) ¯ E ( Y i * ) and is detrimental to all in the opposite case, g n n < E ( Y ) ¯ E ( Y i * ) .

4.2. Increasing the Partnership

Consider now a scenario, where n partners consider adding a new ( n + 1 ) t h partner. The current expected revenue, g n n E ( Y i ) E ( Y i * ) E ( Y ) ¯ , needs to be compared to the new one, g n + 1 n E ( Y i ) E ( Y i * ) E ( Y n + 1 ) / n + E ( Y ) ¯ , i = 1 , 2 , , n . Consider first the case where the addition of the new partner does not alter the identity of the most profitable one, i * , i.e., that E ( Y n + 1 ) is not the highest expected revenue in the group. Then, the inclusion of the new partner benefits all (including themself) if
E ( Y n + 1 ) < g n + 1 g ( n ) g ( n ) / n E ( Y ) ¯ .
If the new partner is more profitable when working alone than any other partner, then the inclusion of such a partner benefits all (including themself) if
E ( Y n + 1 ) > E ( Y i * ) g ( n ) g n + 1 g n n E ( Y i * ) E ( Y ) ¯ .
We note that the two cases above act in opposite directions. The less profitable the new partner in the first case or the more profitable the new partner in the second case, the more the inclusion of such a partner benefits all.

5. Non-Zero Disagreement Points

Assume that there are two partners and, without loss of generality, that d 1 > d 2 and E i X > d i ,   i = 1 , 2 . The K-S condition is as follows:
E 1 u 1 X E 1 u 1 p X + K E 1 u 1 p X + K d 1 = E 2 u 2 X E 2 u 2 X p X K E 2 u 2 X p X K d 2 .
For risk neutral partners, u 1 r = u 2 r = r , we have the following:
E 1 X E 1 p X + K E 1 p X + K d 1 = E 2 X E 2 X p X K E 2 X p X K d 2 .
That is,
( 1 p ) E 1 X K 1 p E 2 X K d 2 = p E 2 X + K p E 1 X + K d 1 ,
so,
1 2 p E 1 X E 2 X K E 1 X + E 2 X d 2 d 2 1 p E 1 X = d 1 ( K + p E 2 X ) .
Thus,
K = 1 2 p E 1 X E 2 X d 2 1 p E 1 X + d 1 p E 2 X E 1 X + E 2 X d 2 d 1 .
The K-S solution, i.e., the point closest to the ideal point u 1 , u 2 = E 1 X , E 2 ( X ) that satisfies (12), is as follows:
  • For equal means, E 1 X = E 2 X , multiple solutions satisfy
    K = E i ( X ) d 2 2 E i ( X ) d 1 d 2 p E i ( X ) ,     0 p 1 ,     i = 1 , 2 .
  • If E 1 X > E 2 X , the solution is p = 1 and K = E 2 X ( E 1 X d 1 ) E 1 X + E 2 X d 1 d 2 ;
    i.e., K is negative.
  • If E 1 X < E 2 X , the solution is p = 1 and K = E 1 X ( E 2 X d 2 ) E 1 X + E 2 X d 1 d 2 ;
    i.e., K is positive.
The dependence of K on E 1 X and E 2 X is further demonstrated by the following derivatives:
d K d E 1 ( X ) = E 2 X d 2 E 1 X + E 2 X d 1 d 2 2 E 2 X ,         i f       E 1 X > E 2 X d 1 + d 2 E 2 X ,       i f     E 1 X < E 2 X  
d K d E 2 ( X ) = E 1 X d 1 E 1 X + E 2 X d 1 d 2 2 d 1 + d 2 E 1 X ,         i f       E 1 X > E 2 X E 1 X ,             i f     E 1 X < E 2 X  
In a particular case where d 1 = d 2 d , the dependence of K on d is given by
d K d d = E 1 X E 2 X E 1 X + E 2 X 2 d 2 E 2 X ,       i f       E 1 X > E 2 X E 1 X ,       i f     E 1 X < E 2 X  
which is negative in the first case and positive in the second.

6. Non-Linear Contracts

Consider two risk-neutral partners and a non-linear contract:
r x = K + p f x ,
where f ( x ) is positive and increasing. For the zero-disagreement point, the K-S condition satisfies
K + p E 1 f ( X ) E 2 X + K + p E 2 f ( X ) E 1 X = E 1 X E 2 X .
Equivalently,
K = E 1 X E 2 X E 1 X + E 2 X p E 1 f ( X ) E 2 X + E 2 f ( X ) E 1 X E 1 X + E 2 X .
We see that, again, K decreases in p. Constraint (3) takes the following form:
0 p min x 0 x x 1 f x 1 .
The K-S solution maximizes the linear objective:
max K , p K + p E 1 f ( X ) ,
subject to the linear constraints (13) and (14). The solutions are as follows:
If E 1 f ( X ) > E 2 f ( X ) , then p = min x 0 x x 1 f ( x ) 1 ;
If E 1 f ( X ) < E 2 f ( X ) , then p = 0 ;
If E 1 f ( X ) = E 2 f ( X ) , then any feasible solution solves the problem.
Example 5.
r x = K + p x a , φ i x = b i x b i 1 , 0 x 1 , b i 1 , a 1 .
E i X = b i b i + 1 ,  E i X a = b i b i + a . Here, 0 p 1 / a and
K = b 1 b 2 1 p b 1 + 1 b 1 + a + b 2 + 1 b 2 + a b 1 b 2 + 1 + b 2 b 1 + 1 .
K increases in a; i.e., the more convex r(x) is, the higher the transfer to that partner.
The rest of the K-S solution is
If b 1 > b 2 , then p = 1 a ;
If b 1 < b 2 , then p = 0 ;
If b 1 = b 2 , then multiple solutions are given by 0 p 1 a .
Example 6.
r x = K + p e x , X i ~ U [ a i ,   b i ]
E i X = a i + b i 2 ,  E i e X = e b i e a i b i a i . Here, p is bounded by 0 p e m a x { b 1 , b 2 } .
The K-S solution is
If e b 1 e a 1 b 1 a 1 > e b 2 e a 2 b 2 a 2 , then p = e m a x { b 1 , b 2 } ;
If e b 1 e a 1 b 1 a 1 = e b 2 e a 2 b 2 a 2 , then multiple solutions are given by 0 p e m a x { b 1 , b 2 }
for these two cases:
K = a 1 + b 1 a 2 + b 2 2 a 1 + b 1 + a 2 + b 2 p a 1 + b 1 + a 2 + b 2 e b 1 e a 1 b 1 a 1 a 2 + b 2 + e b 2 e a 2 b 2 a 2 a 1 + b 1 .
If e b 1 e a 1 b 1 a 1 < e b 2 e a 2 b 2 a 2 , then p = 0 and K = a 1 + b 1 a 2 + b 2 2 a 1 + b 1 + a 2 + b 2 .

7. Asymmetric K-S Solution

This section considers asymmetric K-S solutions (Dubra, 2001; Karos et al., 2018). In our notation, and assuming that d 1 = d 2 = 0 , an asymmetric solution satisfies
E 2 u 2 X r ( X ) = λ E 1 u 1 r ( X ) E 2 u 2 X E 1 u 1 X ,
“allowing” λ to take any value in [ 0 , ) . The rationale for such model, and its consequences, are given by Dubra.
Similarly to Section 2, The K-S solution is obtained by solving the following optimization problem:
max r ( · ) E 1 u 1 r ( X )
s.t.
E 2 u 2 X r ( X ) = λ E 1 u 1 r ( X ) E 2 u 2 X E 1 u 1 X ,
0 d d x r x 1 .
The solutions of (16)–(18) for risk-neutral partners and a linear contract,
r x = p x + K , are as follows:
  • For equal means, E 1 X = E 2 X E X ; multiple solutions are given by
    K = 1 1 + λ p E X ,   0 p 1             p .
    d K d λ = E X 1 + λ 2 < 0 .
    So, K is decreasing in λ but less so as λ grows.
  • For E 1 X > E 2 X , the solution is p = 1 and K = λ E 1 X E 2 X E 1 X + λ E 1 X ;
    i.e., K is negative and more so the larger λ .
  • For E 1 X < E 2 X , the solution is p = 0 and K = E 1 X E 2 X E 1 X + λ E 2 X ;
    i.e., K is positive and decreasing in λ .
Example 7.
r x = p x + K ,  u i r = ( a + r ) α i , r > a ,  0 < α i < 1 , a 0 ,
X i ~ U 0,1 ,   i = 1 , 2 . For the utility functions to be properly defined for all 0 x 1 , the value of K must be in a ,   a . The asymmetric K-S condition (15) becomes
λ 1 p 1 + a 1 + α 2 a 1 + α 2 a + K + p 1 + α 1 a + K 1 + α 1 = p 1 + a 1 + α 1 a 1 + α 1 1 + a K p 1 + α 2 a K 1 + α 2 .
Objective (16) is increasing in K , so K * = a   p * = 4 λ   a 1 λ + 1 .
A different kind of a generalization of K-S solution for d 1 = d 2 = 0 is as follows:
E 2 u 2 X r ( X ) = E 1 u 1 r ( X ) E 2 u 2 X E 1 u 1 X θ ,   θ > 0 .
For a rational and consequences of such model see (Karos et al., 2018). For risk-neutral partners and a linear contract, that equation, which is now
E 2 1 p X K = E 1 p X + K E 2 X E 1 X θ ,
is satisfied for
K = 1 p E 2 ( X ) p E 1 ( X ) m θ 1 + m θ ,   where   m θ E 2 X E 1 X θ .
Substituting into the objective, which is now
max p p E 1 X + 1 p E 2 ( X ) 1 + m θ ,
the conclusion is same as for the basic K-S solution: if E 1 X > E 2 X , then p = 1 ; if E 1 X < E 2 X , then p = 0 .

8. Division Partly Proportional to Relative Investments

Suppose now that the parties invest B i   e a c h , i = 1 , 2 , and the profit grows in the magnitude of B 1 + B 2 . We shall assume that p r o f i t i = X i + h i B 1 + B 2 , when X i is, according to partner i , the random profit when B 1 + B 2 = 0 , and h i is increasing and functions concavely (reflecting diminishing returns of total investment) with h i 0 = 0 ,   i = 1 ,   2 . Thus, E p r o f i t i = E X i + h i B 1 + B 2 E ~ i .
Profit sharing is, according to r x = B 1 B 1 + B 2 x + K , based on the fraction of total investment due to one partner. Suppose that d i = B i ,   i = 1 ,   2 , thus, in case of disagreement, the parties retain their investments. Then, if parties are risk-neutral, the K-S condition implies that
K = B 2 E ~ 1 ( E ~ 2 B 2 ) B 1 E ~ 2 ( E ~ 1 B 1 ) ( B 1 + B 2 ) ( E ~ 1 B 1 + E ~ 2 B 2 ) .
Note that if B i = 0 then d K d B j < 0 .
Special cases:
  • Equal investments, B 1 = B 2 B . Then
    K = B E 2 E 1 2 E 1 + E 2 2 B , E 1 < E 2 ,     E 1 + E 2 > 2 B   o r E 1 > E 2 ,     E 1 + E 2 < 2 B     K B , in both cases.
  • Equal expected profits, E 1 = E 2 E , and h 1 = h 2 h . Let B 2 > B 1 .
    K = ( B 2 B 1 ) ( E 2 + 2 E h + h 2 E B 1 h B 1 ) ( B 1 + B 2 ) ( 2 E + 2 h B 1 B 2 ) = ( B 2 B 1 ) ( E ~ 2 B 1 E ~ ) ( B 1 + B 2 ) ( 2 E ~ B 1 B 2 ) .
    d K d E ~ = 2 E ~ 2 2 ( B 1 + B 2 ) E ~ + B 1 ( B 1 + B 2 ) ( 2 E ~ B 1 B 2 ) 2 < 0 if   B 1 + B 2 B 2 2 B 1 2 2 < E ~ < B 1 + B 2 + B 2 2 B 1 2 2 .
    d K d B 1 = 2 E ~ ( 1 2 E ~ ) B 1 3 + E ~ ( 1 + B 2 + 4 E ~ 2 ) B 1 2 + 2 E ~ ( E ~ + B 2 B 2 E ~ + 2 B 2 2 E ~ ) B 1 + E ~ B 2 3 + E ~ ( 4 E ~ 2 2 E ~ + 1 ) B 2 2 2 E ~ 2 B 2 ( B 1 + B 2 ) 2 ( 2 E ~ B 1 B 2 ) 2
The denominator is clearly positive. As for the numerator, some cases are as follows:
B 2 = B 1 = 1 d K d E ~ > 0   i f f   E ~ < 1
B 2 = 2 , B 1 = 1 d K d E ~ > 0   i f   E ~ < 1 + 29 4 ~ 1.07 .

9. Concluding Remarks

The prediction of negotiation’s outcome via the K-S solution has some attractive properties when used in Operations Management (see Feng et al., 2022), and, as we saw, it can be used for the purpose of this paper as well. We formulated the general K-S profit division problem and showed its consequences for some sharing functions, utility functions and beliefs. Further, we showed that “richer” asymmetric versions (due to Dubra, 2001; Karos et al., 2018) can be used as well. We then focused on the commonly used linear contracts. The disagreement point was shown to have a major impact on the solution.
We also considered a scenario where profit is increasing in partners’ investments, and its shares equal the relative investment in the partnership. Future research in that direction may address diminishing returns on investment, of the type B 1 B 1 + B 2 α ,   0 < α 1 , and/or profit multiplicative in investments.
One might explore profit sharing when partners generate their own revenue, as well as joint revenue. Cost allocation according to revenues of facility-sharing “partners” could also be of interest.

Author Contributions

Conceptualization, Y.G.; Methodology, Y.G.; Formal analysis, E.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in the study are included in the article, further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Dubra, J. (2001). An asymmetric Kalai-Smorodinsky solution. Economics Letters, 73, 131–136. [Google Scholar] [CrossRef]
  2. Feltham, G. A., & Xie, J. (1994). Performance measure congruity and diversity in multi-task principal/agent relations. The Accounting Review, 69(3), 429–453. [Google Scholar]
  3. Feng, Q., Li, Y., & Shanthikumar, J. G. (2022). Negotiations in competing supply chains: The Kalai-Smorodinsky bargaining solution. Management Science, 68(8), 5868–5890. [Google Scholar] [CrossRef]
  4. Gerchak, Y., & Khmelnitsky, E. (2019a). Bargaining over shares of uncertain future profits. EURO Journal on Decision Processes, 7, 55–68. [Google Scholar] [CrossRef]
  5. Gerchak, Y., & Khmelnitsky, E. (2019b). Partnership’s profit sharing: Linear and non-linear contracts. International Game Theory Review, 21(2), 1–18. [Google Scholar] [CrossRef]
  6. Gerchak, Y., & Khmelnitsky, E. (2021). Sharing profit and risk in partnership. In D. M. Kilgour, & C. Eden (Eds.), Handbook of group decision and negotiation. Springer. [Google Scholar]
  7. Kalai, E., & Smorodinsky, M. (1975). Other solutions to Nash’s bargaining problem. Econometrica, 43(3), 513–518. [Google Scholar] [CrossRef]
  8. Karos, D., Muto, N., & Rachmilevitch, S. (2018). A generalization of the Egalitarian and the Kalai-Smorodinsky bargaining solutions. International Journal of Game Theory, 47, 1169–1182. [Google Scholar] [CrossRef]
  9. Levin, J., & Tadelis, S. (2005). Profit sharing and the role of professional partnerships. The Quarterly Journal of Economics, 120(1), 131–171. [Google Scholar]
  10. Muthoo, A. (1999). Bargaining theory with applications. Cambridge University Press. [Google Scholar]
  11. Nash, J. (1953). Two-person cooperative games. Econometrica, 21(1), 128–140. [Google Scholar] [CrossRef]
  12. Wilson, R. (1968). The theory of syndicates. Econometrica, 36(1), 119–132. [Google Scholar] [CrossRef]
Figure 1. Illustration of the K-S solution in Example 3.
Figure 1. Illustration of the K-S solution in Example 3.
Games 16 00029 g001
Figure 2. Parameters p (left side) and K (right side) of the K-S solution in Example 3. Black line is for λ 1 = 1 and λ 2 = 4 , blue line is for λ 1 = 4 and λ 2 = 1 .
Figure 2. Parameters p (left side) and K (right side) of the K-S solution in Example 3. Black line is for λ 1 = 1 and λ 2 = 4 , blue line is for λ 1 = 4 and λ 2 = 1 .
Games 16 00029 g002
Figure 3. Parameters p (left side) and K (right side) as functions of α 1 (Example 4). Bold, thin, and dashed lines correspond to α 2 = 0.3 ,   0.5 ,   0.7 , respectively.
Figure 3. Parameters p (left side) and K (right side) as functions of α 1 (Example 4). Bold, thin, and dashed lines correspond to α 2 = 0.3 ,   0.5 ,   0.7 , respectively.
Games 16 00029 g003
Figure 4. Parametric plot in the (p,K) domain (Example 4): bold, thin, and dashed lines correspond to   α 2 = 0.3 ,   0.5 ,   0.7 , respectively.
Figure 4. Parametric plot in the (p,K) domain (Example 4): bold, thin, and dashed lines correspond to   α 2 = 0.3 ,   0.5 ,   0.7 , respectively.
Games 16 00029 g004
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Gerchak, Y.; Khmelnitsky, E. The Raiffa–Kalai–Smorodinsky Solution as a Mechanism for Dividing the Uncertain Future Profit of a Partnership. Games 2025, 16, 29. https://doi.org/10.3390/g16030029

AMA Style

Gerchak Y, Khmelnitsky E. The Raiffa–Kalai–Smorodinsky Solution as a Mechanism for Dividing the Uncertain Future Profit of a Partnership. Games. 2025; 16(3):29. https://doi.org/10.3390/g16030029

Chicago/Turabian Style

Gerchak, Yigal, and Eugene Khmelnitsky. 2025. "The Raiffa–Kalai–Smorodinsky Solution as a Mechanism for Dividing the Uncertain Future Profit of a Partnership" Games 16, no. 3: 29. https://doi.org/10.3390/g16030029

APA Style

Gerchak, Y., & Khmelnitsky, E. (2025). The Raiffa–Kalai–Smorodinsky Solution as a Mechanism for Dividing the Uncertain Future Profit of a Partnership. Games, 16(3), 29. https://doi.org/10.3390/g16030029

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop