1. Introduction
A two-person bargaining situation involves two individuals who have the possibility of concluding a mutually beneficial agreement, but there is a conflict of interests about which agreement to conclude, and no agreement can be imposed on any individual without her approval. One bargaining procedure dominates the literature on noncooperative bargaining models: Rubinstein’s alternating-offer bargaining procedure [
1]. In Rubinstein’s model, the players alternate in making proposals, with no exogenous bound on the length of time that they may bargain. They also have time preferences: among agreements reached at the same time players prefer larger shares of the cake and prefer to obtain any given share of the cake sooner rather than later. Under mild conditions on the time preferences of the players, Rubinstein has shown that the alternating-offer bargaining game with complete information yields a unique subgame perfect equilibrium (SPE). In this SPE, agreement is reached without delay and the less impatient player obtains a larger share of the cake.
Rubinstein’s model assumes that players have purely selfish preferences. Experimental and field evidence conflicts with the hypothesis of selfishness and suggests that players have interdependent preferences.
1 In other words, when players bargain over the division of a cake they are also influenced by relative share considerations. For instance, Brown, Gardner, Oswald and Qian [
5], using data collected from 16,000 British workers, have found evidence that the welfare of a worker is not solely determined by his or her material circumstances, but also depends on his or her relative wage and the rank-ordered position of his or her wage within a comparison set.
2The purpose of this paper is to provide a theoretical study of how relative concerns will affect the outcome of Rubinstein’s alternating-offer model when players have either complete information or private information. One bargainer has preferences over relative payoffs (fairness) as well as absolute payoffs (pecuniary). Her utility increases as the absolute payoff increases, but it diminishes as her relative payoff deviates from the fair standard. The other bargainer is selfish and simply maximizes his own payoff. We find that, under complete information, facing an opponent having stronger relative concerns only hurts the bargainer when she is stronger than her opponent. Once incomplete information is added into the bargaining, agreement may be reached with delay. We show that an increase of one party’s relative concerns decreases the delay in reaching an agreement. Intuitively, when the bargainer who has relative concerns cares more about payoff inequality, she becomes more inclined to concede and to rapidly accept a smaller share of the surplus than before, since this loss is compensated by the increased utility due to less envy and compassion. In addition, when the selfish bargainer faces an opponent who dislikes more payoff inequality, then the payoffs he could obtain become closer to the equitable payoff division. Hence, this selfish player will also be more inclined to rapidly reach an agreement.
The paper is organized as follows. In
Section 2 we introduce the bargaining model and solve it under complete information. In
Section 3 we consider the bargaining with private information. In
Section 4 we characterize the maximal delay in reaching an agreement. In Section 5 we conclude.
2. Model
Two players
i (
) are bargaining over the division of a cake of size one. These two players must agree on an allocation from the set
X where
is player
i’s share, for
. Player 1 cares about her own share and, in addition, would like to reduce the inequality in shares between the two players. Formally, the objective of player 1 is to maximize a utility function similar to Bolton and Ockenfels’ [
7] model of inequality aversion:
where the parameter
γ,
, captures the loss from inequality if player 1’s share is below or above an equitable allocation.
3 Player 2 is a purely selfish player who simply maximizes his share of the cake:
.
4We adopt Rubinstein’s alternating-offer bargaining procedure. Player 1 calls (offers/accepts) in even-numbered periods and player 2 calls in odd-numbered periods. Let
be the period at which an offer is made. The game starts at
and ends when one of the players accepts the opponent’s previous offer. Note that an agreement may be reached as early as in period
. The length of each period is Δ. No limit is placed on the time that may be expended in bargaining and perpetual disagreement is a possible outcome. Both players are assumed to be impatient and they have time preferences with constant discount rates. That is, player
i is indifferent between receiving
today and
tomorrow, where
is player
i’s discount rate. To capture the notion that the time it takes to come to terms is small relative to the length of the contract, we assume that the time between periods is very small. As the interval between offers and counteroffers shortens and shrinks to zero, the alternating-offer model has a unique limiting subgame perfect equilibrium (SPE), which approximates the Nash bargaining solution to the bargaining problem (see Binmore, Rubinstein and Wolinsky [
9]). Hence, the SPE shares are given by
, where the status quo payoffs are zero and the parameter
α,
, is equal to
and can be interpreted as player 1’s bargaining power. A simple calculation leads to:
Then, the SPE payoffs for player 1 and player 2 are equal to:
Of course, we have that and . In addition, if and only if . More interestingly, we find that if and only if and if and only if . So the equilibrium share of player 2 (and his payoff) is increasing with the relative concerns of player 1 when player 1 has more bargaining power than player 2 (i.e., when or ).
Proposition 1. Consider the alternating-offer bargaining game with complete information and where only player 1 has relative concerns. An increase of player 1’s relative concerns increases player 2’s SPE payoff if and only if player 1 is more patient than player 2.
The intuition behind this proposition is as follows. Whether an increase in γ is beneficial or not for player 2 depends on his relative bargaining power. When player 2 is weaker than his opponent (or less patient), then he prefers to face an opponent who cares more about relative concerns, since this opponent will claim a more equitable allocation. However, once player 2 becomes stronger than his opponent, then facing a party who cares more about equity will reduce player 2’s share of the pie. In other words, an increase of player 1’s relative concerns will decrease (increase) player 2’s “real bargaining power" when player 2 is more (less) patient than player 1. To conclude, facing an opponent having stronger relative concerns only hurts the bargainer when she is stronger than her opponent.
3. Maximum Delay in Reaching an Agreement
Both the asymmetric Nash bargaining solution and Rubinstein’s model predict efficient outcomes of the bargaining process. In particular, agreement is reached immediately.
5 This is not the case once we introduce incomplete information into the bargaining, in which the first rounds of the negotiation are used for information transmission between the two negotiators.
We now suppose that both players have private information. Neither player knows the impatience (or discount rate) of the other party. It is common knowledge player 1’s discount rate lies in the range
, where
, and that player 2’s discount rate lies in the range
, where
. The discount rates
and
identify the most patient and most impatient types, respectively. The types are independently drawn from the set
according to the probability distribution
, for
. This uncertainty implies bounds on player 1’s bargaining power which are denoted by
and
. Watson [
12] has characterized the set of perfect Bayesian equilibrium (PBE) payoffs which may arise in Rubinstein’s alternating-offer bargaining game and constructed bounds (which are met) on the agreements that may be made. The bounds and the PBE payoffs set are determined by the range of incomplete information, and are easy to compute because they correspond to the SPE payoffs of two bargaining games with complete information. These two games are defined by matching one player’s most impatient type with the opponent’s most patient type.
Lemma 1. Consider the alternating-offer bargaining game with incomplete information in which the distributions and are common knowledge, and in which the period length shrinks to zero. For any perfect Bayesian equilibrium (PBE), the payoff of player 1 belongs to and the payoff of player 2 belongs to .
In Lemma 1,
and
denote, respectively, the SPE utility of player 1 and the SPE utility of player 2 of the complete information game, when it is common knowledge that player 1’s bargaining power is
. Since we allow for general distributions over types, multiplicity of PBE is not an exception even when the game is almost with complete information. For instance, Watson [
12] has examined Rubinstein’s bargaining games in which with high probability a player’s discount rate is close to a certain value, yet there is a slight chance that the player’s discount rate is much higher or much lower. Watson has shown that the set of equilibrium payoffs does not converge to that of the complete information, despite that the game converges to one of complete information. More precisely, the set converges from above but not from below in the sense that a player cannot gain if there is a slight chance that she is very patient, yet she can suffer if there is a slight chance that she is impatient.
6The bargaining game may involve delay, but not perpetual disagreement, in equilibrium.
7 Delay is positively related to the distance between the discount rates of the most and least patient types of the players. If the range of types is reduced, then this leads to a smaller range of possible payoffs and less delay. Delay can even occur when the game is close to one of complete information (as the type distributions converge to point mass distributions). We propose to analyze the maximum delay time in reaching an agreement. It is simply the minimum between the maximum real time player 1 would spend bargaining and the maximum real time player 2 would spend bargaining. This measure is, on average, a good proxy for actual delay in reaching an agreement.
8 The maximum real time player 1 (player 2) would spend bargaining is the time
(
) such that player 1 (player 2) is indifferent between getting the lower bound PBE payoff at time 0, and getting the upper bound PBE payoff at time
(
). In the
Appendix we derive the expression for the maximum delay in equilibrium which shows that an agreement is reached in finite time and that delay time equals zero as incomplete information vanishes (in that
and
converge).
9Formally, delay in reaching an agreement is given by
, where
is the maximum real time player 1 would spend negotiating, and
is the maximum real time player 2 would spend negotiating. In fact,
is the maximum real time player 1 would spend negotiating if it were of the most patient type. Similarly,
is the maximum real time player 2 would spend negotiating if it were of the most patient type. So,
and
are the upper bounds on the maximum time player 1 of type
and player 2 of type
would spend negotiating. Since
and
are positive, finite numbers, the maximum real delay in reaching an agreement is finite and converges to zero as
and
become close. Taking the derivatives with respect to
γ, we get that
and
.
Proposition 2. Consider the alternating-offer bargaining game with incomplete information and where only player 1 has relative concerns. An increase of player 1’s relative concerns decreases both the maximum real time player 1 would spend negotiating and the maximum real time player 2 would spend negotiating.
The intuition behind this proposition is as follows. An increase of player 1’s relative concerns (γ increases) expands the payoff set or range of possible payoffs for player 1. Hence, it increases the scope for potential delay in reaching an agreement since more time may be needed for screening the private information. However, there is a second effect at play. When γ increases, player 1 is more inclined to concede, and to agree more rapidly on a smaller share of the surplus than before, since it is compensated by the increased utility due to less envy and compassion. This second effect dominates the first one. Hence, . For player 2 who is purely selfish but faces an opponent who dislikes payoff inequality, an increase of player 1’s relative concerns reduces the range of possible payoffs for player 2 to shares closer to the equitable division. Hence, . Since the delay in reaching an agreement, , is equal to , we conclude that an increase of player 1’s relative concerns will decrease the maximum real delay in reaching an agreement.
Table 1.
Maximum delay in reaching an agreement.
Table 1.
Maximum delay in reaching an agreement.
γ | 1 | | | | |
---|
| | | | | | | | | | |
0.18 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0.17 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
0.16 | 0 | 0 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 |
0.15 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 1 | 2 | 2 |
0.14 | 2 | 2 | 2 | 2 | 2 | 2 | 2 | 2 | 3 | 3 |
0.13 | 2 | 2 | 3 | 3 | 3 | 3 | 3 | 3 | 4 | 4 |
0.12 | 3 | 3 | 4 | 4 | 4 | 4 | 5 | 5 | 5 | 5 |
0.11 | 5 | 4 | 5 | 5 | 6 | 5 | 6 | 6 | 7 | 7 |
0.10 | 6 | 6 | 7 | 6 | 7 | 7 | 8 | 8 | 9 | 9 |
0.09 | 8 | 7 | 9 | 8 | 9 | 9 | 10 | 10 | 11 | 11 |
0.08 | 10 | 10 | 11 | 11 | 12 | 12 | 14 | 14 | 15 | 14 |
0.07 | 14 | 13 | 15 | 14 | 16 | 16 | 18 | 18 | 19 | 19 |
0.06 | 19 | 17 | 20 | 19 | 22 | 21 | 24 | 24 | 25 | 25 |
0.05 | 26 | 23 | 28 | 26 | 30 | 29 | 33 | 32 | 35 | 35 |
0.04 | 38 | 32 | 41 | 37 | 44 | 42 | 47 | 47 | 50 | 50 |
We now illustrate our main results by means of an example. Suppose that both players have the same bounds on their discount rates:
,
,
with
.
Table 1 gives the integer part of the maximum delay for the different values of the parameter
γ. We can interpret
as the annual discount rate and the numbers in
Table 1 as the maximum number of days needed to reach an agreement. Indeed, the integer part of the maximum delays for
are exactly the numbers in
Table 1.
10 We observe that (i) the real delay time in reaching an agreement is not negligible: many bargaining rounds may be needed in equilibrium before an agreement is reached; (ii)
and
are decreasing with
γ; (iii)
and
are increasing with the amount of private information
; (iv) the maximum delay
is decreasing with
γ; (v)
. Results (i)–(iv) hold in general.
4. Concluding Discussion
We have considered Rubinstein’s alternating-offer bargaining model with two-sided incomplete information and we have investigated the effects of having relative concerns on the agreement and the delay in reaching this agreement. We have shown that an increase of relative concerns will decrease the delay in reaching an agreement.
Fehr and Schmidt [
8] have proposed an alternative model of inequality aversion:
, where they assume that
and that
β satisfies
. The parameter
γ captures the envy. If the parameter
β is positive, then it captures the compassion. But if
β is negative, then it captures the pride. One can see that if
β is negative and equal to
, then the Fehr and Schmidt’s model reduces to the utility function
where pride is as strong as envy and there is no compassion. It can be shown that, as long as pride is as strong as envy and there is no compassion, the bargaining outcome does not depend on the parameter
γ. However, if
β is positive and equal to
γ (
i.e., compassion is as strong as envy and there is no pride), then the Fehr and Schmidt’s model reverts to Bolton and Ockenfels’ model of inequality aversion and delay in reaching an agreement decreases as relative concerns increase.
11We have limited the analysis to the case where only one player is not purely selfish. We now provide some insights about what would happen under complete information if both players had relative concerns captured by Fehr and Schmidt’s [
8] model of inequality aversion with
and
.
12 For
, the SPE payoffs for player 1 and player 2 are equal to
Hence, when player 1 is sufficiently less patient than player 2, an increase of player 1’s envy
γ decreases player 2’s SPE payoff. In addition, an increase of player 1’s envy
γ increases player 1’s SPE payoff. Notice that an increase of player 2’s compassion
β increases (decreases) the payoff of player 1 (player 2). For
, the SPE payoffs for player 1 and player 2 are equal to
Closely related to Proposition 1, we obtain that an increase of player 1’s compassion
β increases player 2’s SPE payoff if player 1 is sufficiently more patient than player 2. Once both players have private information, based on the intuition provided by the one sided relative concerns case, we expect that delay will be even more reduced since both players are more inclined to concede and agree rapidly on a more equitable allocation of the surplus.
13