Next Article in Journal
New Closed-Form Solution for Quadratic Damped and Forced Nonlinear Oscillator with Position-Dependent Mass: Application in Grafted Skin Modeling
Next Article in Special Issue
Feature Selection Using Artificial Gorilla Troop Optimization for Biomedical Data: A Case Analysis with COVID-19 Data
Previous Article in Journal
High-Dimensional Statistics: Non-Parametric Generalized Functional Partially Linear Single-Index Model
Previous Article in Special Issue
A Feature Selection Based on Improved Artificial Hummingbird Algorithm Using Random Opposition-Based Learning for Solving Waste Classification Problem
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Equilibrium in a Bargaining Game of Two Sellers and Two Buyers

1
School of Computer Science, University of Nottingham Ningbo China, Ningbo 315100, China
2
School of Computer Science, University of Nottingham UK, Nottingham NG7 2RD, UK
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(15), 2705; https://doi.org/10.3390/math10152705
Submission received: 6 July 2022 / Revised: 27 July 2022 / Accepted: 28 July 2022 / Published: 30 July 2022
(This article belongs to the Special Issue Advanced Optimization Methods and Applications)

Abstract

:
The uniqueness of equilibrium in bargaining games with three or more players is a problem preventing bargaining theory from general real world applications. We study the uniqueness of bargaining equilibrium in a bargaining game of two sellers and two buyers, which has instances in real-world markets. Each seller (or buyer) wants to reach an agreement with a buyer (or seller) on the division of a pie in the bargaining game. A seller and a buyer will receive their agreed divisions if they can reach an agreement. Otherwise, they receive nothing. The bargaining game includes a finite number of rounds. In each round, a player can propose an offer or accept an offer. Each player has a constant discounting factor. Under the assumption of complete information, we prove that the equilibrium of this bargaining game is the same division of two pies. The ratio of division as a function of the discount factors of all players is also deduced. The result can be extended to a bargaining game of n-sellers and n-buyers, which reveals the relevance of bargaining equilibrium to the general equilibrium of a market.

1. Introduction

Bargaining games concern situations in which the players bargain over the division of certain goods. Game theorists have developed both axiomatic approaches and sequential approaches for two-player bargaining games. With an axiomatic approach, Nash proved that there was a unique equilibrium for two-player bargaining games, called the Nash bargaining equilibrium, under a series of axiomatic assumptions [1]. Rubinstein [2] developed a sequential strategic approach in which two players took turns making alternating offers. In the case where each player has a constant discounting factor ( δ 1 and δ 2 ), the equilibrium is proven to be ( 1 δ 2 ) / ( 1 δ 1 δ 2 ) . Binmore et al. [3] discussed the relationship between these two approaches. Stâhl [4] discussed a finite version of Rubinstein’s method. Backus et al. [5] conducted experiments on sequential online bargaining and concluded that behavioral norms played important roles in making bargaining successful.
Nash bargaining equilibrium could be widely used in solving decision-making problems if it could be extended to a bargaining game with more than two players. Researchers have found that the uniqueness of bargaining equilibrium does not hold in the bargaining games where multiple players bargain over how to share a pie, even under the condition of a common discounting factor [6,7,8]. Baron and Ferejohn [9] presented a sequential model of multiple players bargaining in a cake-dividing game with a simple majority rule. They concluded that the output of bargaining depends on the bargaining settings, that is, the open and close rules and the sequence of offer making. Recent work on n 3 -person bargaining games also includes [10,11,12,13,14,15,16,17,18,19]. A recent survey of the theoretical literature on legislative and multilateral bargaining is [20].
It has been revealed that the uniqueness of a bargaining equilibrium can be achieved by introducing some extra constraints to the model of bargaining, that is, the exit opportunity [21,22,23], delay effect [24], asymmetric players [25], and incomplete information assumption [26,27]. Collard-Wexler et al. [28] studied bargaining among multiple upstream and downstream firms, in which the upstream and downstream firms would bargain in pairs. Each pair’s bargaining solution was arbitrarily close to the Nash bargaining equilibrium. This research shows that the uniqueness of an equilibrium can be achieved by assigning the bargainers different roles. Eraslan [25] introduced some monotonicity properties of the equilibrium payoffs in a proof of the uniqueness of an equilibrium. The bargainers choose to join coalitions in which they receive identical payoffs, so they will choose the coalition that maximises individual payoffs. Kawamori [29] showed that all players receive the same payoff if sufficiently patient players with linear preferences have similar recognition probabilities. Kalandrakis [30] established a link between the cost of coalitions of any two players, which provided an alternative proof of the uniqueness of the equilibrium. Montero [31] showed that the payoff of a player could be irrespective of the discount factor, and a patient player might be worse off in a multiplayer bargaining game.
In this article, we study the multiple-player bargaining games by assuming that every player has a specific role in bargaining: either a seller or a buyer. A bargain can be implemented only between different roles, say a buyer and a seller. This is a reasonable assumption since it coincides with the situations in real-world markets.
We study the equilibrium of a bargaining game of two sellers and two buyers. In the game, two buyers and two sellers bargain on how to share two pies. In every round of bargaining, each bargainer can offer a price (division of a pie) or accept a price offered by another player of a different role. A pair of seller and buyer will share a pie if they reach an agreement. Each player has a constant discounting factor. The sellers and buyers who have made agreements divide their pies, and other players receive nothing. We prove that this bargaining game has a perfect equilibrium in which four players reach the same division of two pies.
The contributions of this paper are threefold. First, we prove the uniqueness of the bargaining equilibrium in the bargaining game of two buyers and two sellers. It is the first time that the uniqueness of equilibrium in such a game that reflects multiple players’ bargaining behaviours in a real-world market is proven. Second, we deduce the price in equilibrium is
p = 2 δ b 1 δ b 2 2 δ s 1 δ s 2 ,
where the players have constant discounting factors ( δ s i and δ b i , i = 1 , 2 , for the sellers and buyers, respectively). Third, the analysis method can be extended to a bargaining game of n sellers and n buyers. The outcome of the bargaining is a market clearance price, which provide a microscopic explanation of the concept of general equilibrium in market.
The remainder of this paper is arranged as follows. In Section 2, the preliminary knowledge of the sequential approach is introduced. The advantage of moving first can be eliminated by introducing a bidding stage in which two players bid for the right to make the first offer. We also prove the consistency between the axiomatic approach and the sequential strategic approach. In Section 3, the perfect equilibrium of a bargaining game of two sellers and two buyers is deduced. Then, we provide the conclusions in Section 4.

2. Two-Player Bargaining Game

According to [2], a two-player bargaining game is described as below:
Two players, 1 and 2, are bargaining on the division of a pie. The pie will be divided only after the players reach an agreement. Each player, in turn offers a partition and his opponent may agree to the offer or reject it. Acceptance of the offer ends the bargaining. After rejection, the rejecting player then has to make a counter offer and so on. If no agreement is achieved, both players keep their status quo (no gain no loss).
Let X be the set of possible agreements, D be the status quo (no agreement), and x 1 and x 2 the partitions of the pie that 1 and 2 receive, respectively. The players’ preferences are defined on the set of ordered pairs of the type ( x , t ) , where t is a non-negative integer and denotes the time when the agreement is reached, 0 x 1 , x 1 = x , and x 2 = 1 x . Let i denote player i’s preference ordering over X { D } . There are the following assumptions:
A-1.
Disagreement is the worst outcome: for every ( x , t ) X × T , we have ( x , t ) i D .
A-2.
‘Pie’ is desirable: ( x , t ) i ( y , t ) iff x i y i .
A-3.
‘Time’ is valuable: for every x X , t 1 < t 2 , if ( x , t 2 ) i ( d , 0 ) , then ( x , t 1 ) i ( x , t 2 ) .
A-4.
Stationarity: for every x , y X , Δ > 0 , if ( x , t 1 ) i ( y , t 1 + Δ ) , then ( x , t 2 ) i ( y , t 2 + Δ ) .
A-5.
Continuity: if ( x , t 1 ) i ( y , t 2 ) , there always exists a small positive value ϵ 0 such that ( x + ϵ , t 1 ) i ( y , t 2 ) .
A-6.
Increasing loss to delay: for any c 1 , c 2 > 0 , if ( x + c 1 , t ) i ( x , 0 ) , ( y + c 2 , t ) i ( y , 0 ) and x i > y i then c 1 c 2 .
The players have constant discounting factors: each player has a number 0 δ i 1 such that ( x , t 1 ) i ( y , t 2 ) iff x i δ i t 1 y i δ i t 2 . Under these assumptions, Rubinstein [2] has proven the following Proposition 1.
Proposition 1.
(a) There exists a unique perfect equilibrium of this bargaining game (b). If at least one of the δ i is less than 1 and at least one of them is positive, the bargaining solution is ( x , 0 ) , where x = ( 1 δ 2 ) / ( 1 δ 1 δ 2 ) .
Notice that player 1 is supposed to begin the bargaining. If player 2 began, the solution would be x = ( 1 δ 1 ) / ( 1 δ 1 δ 2 ) . The player who makes the first offer has an advantage in bargaining and receives a larger partition of the pie than what would be received if another player had made the first offer.
Binmore et al. [3] gave a procedure to eliminate the advantage of moving first, as follows: Let the time delay between successive periods be Δ , and represent the discount factor as δ Δ . Then, in the limit Δ 0 , it is irrelevant who makes the opening demand.
lim Δ 0 x ( Δ ) = lim Δ 0 y ( Δ ) = x N T P ( 1 , 2 )
where x ( Δ ) and y ( Δ ) denote the pair of agreements, and x N T P ( 1 , 2 ) the Nash bargaining equilibrium.
We introduce another procedure to eliminate the advantage of moving first as follows: Two players bid for the right to make the first offer before bargaining for the division of the pie. Player 1 offers a bid w ( 0 w 1 ) to player 2 to exchange the right of moving first. If player 2 accepts the bid, she receives w division of the pie, and player 1 begins the bargaining to divide the rest 1 w . If player 2 refuses the bid, she wins the right to make the first offer, and player 1 receives w. We then have the following Proposition 2.
Proposition 2.
In the case where two players bid for the right of moving first, the bargaining equilibrium is ( x , 0 ) , where x = ( 1 δ 2 ) / ( 2 δ 1 δ 2 ) .
Proof. 
According to Proposition 1, if player 2 accepts player 1’s bid of exchanging w for the right of moving first, the two players will receive x 1 and x 2 , respectively, where
x 1 = 1 δ 2 1 δ 1 δ 2 ( 1 w )
and x 2 = 1 x 1 . On the other hand, if player 2 refuses player 1’s bid, two players will receive x 1 and x 2 , where
x 1 = w + δ 1 ( 1 δ 2 ) 1 δ 1 δ 2 ( 1 w )
and x 2 = 1 x 1 .
It is obvious that there should be x 1 = x 1 . Then, we have
w = ( 1 δ 1 ) ( 1 δ 2 ) 2 δ 1 δ 2
x 1 = 1 δ 2 2 δ 1 δ 2
x 2 = 1 δ 1 2 δ 1 δ 2
Note that x = 1 / 2 when δ 1 = δ 2 , and it is irrelevant who makes the first offer. If it is player 2 who offers the bid, the result will remain the same. Therefore, the players are indifferent between whether to make an offer or to accept the opponent’s offer. If we regard player 1 as the seller and player 2 the buyer, p = x 1 / x 2 = ( 1 δ 2 ) / ( 1 δ 1 ) can be treated as the price of exchange. Specifically, two players share the pie equally when p = 1 ; player 2 receives the whole pie when p = 0 , and player 1 receives the whole pie when p = . Proposition 2 also shows the consistency between the strategic bargaining approach and the Nash bargaining solution. Let u 1 and u 2 be the von Neumann–Morgenstern utilities of two players. If we define
p N = 1 δ 2 1 δ 1 = a r g m a x ( u 1 ( p ) u 2 ( p ) )
the outcome of Proposition 2 is just the Nash bargaining solution.
Given that the players are equal in bargaining, we assume that the players accept the price in (1) without the extra biding process in the following sections.

3. Bargaining Problem of Two Sellers and Two Buyers

Consider a market where there are only two goods, A and B. Participants in this market negotiate to exchange A for B or to exchange B for A. Without loss of generality, let us assume that those who want to exchange A for B are the sellers, and those who want to exchange B for A are the buyers. The price p is the exchange ratio of the amount of B to A, and it is the only factor that every player is concerned with in the bargaining. The utility function of each player is linearly relevant to the price. The bargaining game is described as below.
Two sellers and two buyers bargain over the divisions of two pies (each pie is of a size of 1). A seller (buyer) has to reach an agreement with a buyer (seller) on the division of a pie. Each player has a constant discounting factor ( δ s i and δ b i for the sellers and buyers, respectively, i = 1 , 2 ). The bargaining game contains a number of rounds in which the sellers and the buyers, in turn, offer divisions to their opponents. In the first round, two sellers, in turn, choose a buyer and offer a division, and the chosen buyer may agree the offer “Y” or reject it “N”. Acceptance of the offer leads to an agreement on sharing the pie, and both players involved in the agreement quit the bargaining. If an offer is rejected, the rejected player remains in the bargaining, and so does the rejecting player unless he has accepted an offer from another seller. In the second round, the buyers remaining in the bargaining choose their opponents and make offers. This process will continue for m rounds if no agreements are reached. We assume rationality and complete information in the game, that is, all players are payoff maximised, and the discount factors of all players are common knowledge.
The sellers are given the advantage of making their offers first. As shown in Section 2, this advantage can be eliminated so that it is irrelevant who makes the first offer. It is possible that two or more players choose the same opponent to make their offers in a single round. Any player in this game will either reach an agreement with an opponent or keep the status quo (no gain, no loss). The price here denotes the ratio of the seller’s share of a pie to the buyer’s. Therefore, each seller prefers a higher price, and each buyer prefers a lower price.
Let F be the set of all pure strategies of the players who offer the divisions, and G be the set of all pure strategies of the players who have to respond to an offer. The result of this bargaining can be expressed by the quad ( x 1 , t 1 , x 2 , t 2 ) , where x 1 , x 2 X denote the divisions of two pies that two pairs of players agree with, respectively.
For the outcome ( x 1 , t 1 , x 2 , t 2 ) to be a perfect equilibrium division, the following conditions should be satisfied:
(P-1) 
There is no x > x 1 such that ( x , t 1 ) b 2 ( x 2 , t 2 ) .
(P-2) 
There is no x < x 1 such that ( x , t 1 ) s 2 ( x 2 , t 2 ) .
(P-3) 
There is no x > x 2 such that ( x , t 2 ) b 1 ( x 1 , t 1 ) .
(P-4) 
There is no x < x 2 such that ( x , t 2 ) s 1 ( x 1 , t 1 ) .
Note that (P-1) and (P-2) ensure that it is not better for s 1 and b 1 to bargain with b 2 or s 2 . Similarly, (P-3) and (P-4) ensure that it is not better for s 2 and b 2 to bargain with b 1 or s 1 . We then have the following Proposition 3:
Proposition 3.
The bargaining game of two sellers and two buyers has an equilibrium—the same division of both pies.
Proof. 
The bargaining game has at least one equilibrium according to Nash (1951). Let the quad ( x 1 , t 1 , x 2 , t 2 ) be an equilibrium satisfying (P-1) to (P-4).
We first prove that if two players reach an agreement, the agreement will be made in the first round. Assume that a seller and a buyer reach an agreement at time t ( t 0 ). Obviously, both sides receive a higher payoff if they make the same agreement at time t = 0 , given that they have positive discounting factors.
Second, we prove that the divisions of both pies must be the same if the players reach two agreements. Assume that the division ratios are different in two agreements. Without loss of generality, suppose that the seller s 1 and the buyer b 1 reach the agreement of division ( x 1 , 0 ) , and s 2 and b 2 reach the agreement of division ( x 2 , 0 ) and x 1 > x 2 . The seller s 2 and buyer b 1 can be better off by making an agreement with any x ( x 1 > x > x 2 ). The division of s 2 increases from x 2 to x , and the division of b 1 increases from 1 x 1 to 1 x . Thus, there must be x 1 = x 2 .
Third, we prove the uniqueness of equilibrium. Assume that there are two quads ( x 1 , 0 , x 1 , 0 ) and ( x 2 , 0 , x 2 , 0 ) , and x 1 x 2 . It is a contradiction that both quads are equilibria of the game. □
With the same division, it is irrelevant for each player to choose who to bargain with. Then, the bargaining turns out to be symmetric: the bargaining between one pair of seller and buyer mirrors the bargaining between another pair. According to Proposition 1, there is a unique perfect equilibrium to the bargaining problem of two players. We now deduce that the following.
(1) If the sellers first make offers, each seller receives x and each buyer receives y.
x = 2 ( 2 δ b 1 δ b 2 ) 4 ( δ b 1 + δ b 2 ) ( δ s 1 + δ s 2 )
y = ( δ b 1 + δ b 2 ) ( 2 δ s 1 δ s 2 ) 4 ( δ b 1 + δ b 2 ) ( δ s 1 + δ s 2 )
(2) If the sellers and buyers bid for the right to make first offers, each seller receives x and each buyer receives y .
x = 2 δ b 1 δ b 2 4 δ b 1 δ b 2 δ s 1 δ s 2
y = 2 δ s 1 δ s 2 4 δ b 1 δ b 2 δ s 1 δ s 2
The price is
p = x y = 2 δ b 1 δ b 2 2 δ s 1 δ s 2
Following Rubinstein [2,32], we define a group of functions v i ( i = s 1 , s 2 , b 1 , b 2 ) as follows:
v i ( x , t ) = y , y X s u c h t h a t ( y , 0 ) i ( x , t ) 0 , y X t h e r e i s ( y , 0 ) i ( x , t )
This means that for any ( x , t ) , either there is y X such that player i ( i { b 1 , b 2 , s 1 , s 2 }) is indifferent between ( x , t ) and ( y , 0 ) , or every ( y , 0 ) is preferred by i to ( x , t ) . In order for two pairs of sellers and buyers to reach the same division, there should be v s 1 = v s 2 and v b 1 = v b 2 . This means that two sellers (buyers) are equal in the bargaining regardless of the values of their discount factors.
In order for two sellers (buyers) to form the same bargaining strategy, there should be
v s 1 ( x , t ) = v s 2 ( x , t ) = 1 2 ( δ s 1 t + δ s 2 t ) x
v b 1 ( x , t ) = v b 2 ( x , t ) = 1 2 ( δ b 1 t + δ b 2 t ) x
The intersection of y s 1 = v 1 ( x s 1 , 1 ) and x b 1 = v 1 ( y b 1 , 1 ) reflects the division ( x , y ) . This can be expressed as Figure 1.
From Figure 1, we have
x = 2 ( 2 δ b 1 δ b 2 ) 4 ( δ b 1 + δ b 2 ) ( δ s 1 + δ s 2 )
y = ( δ b 1 + δ b 2 ) ( 2 δ s 1 δ s 2 ) 4 ( δ b 1 + δ b 2 ) ( δ s 1 + δ s 2 )
When the sellers and buyers bid for the right to make the first offer, the advantage of first offer can be eliminated. The process is that the sellers first offer a bid w ( 0 w 1 ) to the buyers to exchange the right of first offer. If the buyers accept the bid, each buyer receives w division of a pie, and the sellers begin the bargaining to divide the rest of pies. If the buyers refuse the bid, they win the right to make an offer first, and each seller receives w.
If the buyers accept the bid, each seller will receive
x 1 = 2 ( 2 δ b 1 δ b 2 ) 4 ( δ s 1 + δ s 2 ) ( δ b 1 + δ b 2 ) ( 1 w )
If the buyers refuse the bid, each seller will receive
x 2 = ( δ s 1 + δ s 2 ) ( 2 δ b 1 δ b 2 ) 4 ( δ s 1 + δ s 2 ) ( δ b 1 + δ b 2 ) ( 1 w ) + w
Obviously, there should be x 1 = x 2 . Then, we have
x 1 = 2 δ b 1 δ b 2 4 δ b 1 δ b 2 δ s 1 δ s 2
Each buyer receives
y 1 = 1 x 1 = 2 δ s 1 δ s 2 4 δ b 1 δ b 2 δ s 1 δ s 2
Hence,
p = x 1 / y 1 = 2 δ b 1 δ b 2 2 δ s 1 δ s 2 .
According to Proposition 3, a `patient’ player receives an equal division to an `impatient’ player in the bargaining. This counter-intuitive result can be explained as follows. Because every player would like to choose the impatient player to be their bargaining opponent, the impatient player could increase their share by threatening to change their bargaining opponent. Similarly, the patient player had to lower their share because of their opponent’s threat of changing their bargaining opponent. Consequently, a division will be reached so that the sellers (buyers) receive equal division no matter how patient or impatient they are.
Figure 2 shows the relationship between two-player bargaining and two pairs of players bargaining. If the players bargain with each other independently, the solution to two pairs of players bargaining will be either A , C or B , D . Because of the interaction between two pairs of players, A , C and B , D converge to ( x , y ) .

4. Conclusions

The bargaining game of two sellers and two buyers is analysed by using a sequential approach. We have proven that this game has an unique equilibrium in which all players agree on a price. The price is exactly the Nash bargaining equilibrium between the coalition of sellers and the coalition of buyers. The sellers and buyers will equally share two pies when the sellers and buyers have equal aggregated discount factors, or δ b 1 + δ b 2 = δ s 1 + δ s 2 . When the buyers are patient, ( δ b 1 1 and δ b 2 1 ), and when the sellers are not, the price tends to zero. The buyers’ coalition obtains a bargaining payoffs monopoly in this extreme situation. The price tends to infinity ( p ) when the sellers are patient ( δ s 1 1 and δ s 2 1 ) and the buyers are not.
The uniqueness of equilibrium in this game can also be proven via cooperative game theory. Among the possible coalitions of players, the coalition of all sellers and the coalition of all buyers are the cheapest winning coalitions for two types of players. This coincides with the current bargaining theory in the literature.
This is the first time that the uniqueness of equilibrium in a bargaining game of two sellers and two buyers has been proven, which can be further extended to a bargaining problem of n sellers and n buyers with complete information, that is, the price is computed by
p = n δ b 1 δ b 2 δ b n n δ s 1 δ s 2 δ s n
The price is the Nash bargaining equilibrium between the coalition of sellers and the coalition of buyers. This result is non-trivial in understanding the essence of market price and equilibrium state in real world markets. We will give the proof of this in another paper.
The numbers of sellers and buyers are not necessarily equal as long as the amount of goods being bargained are equal. This provides an explanation of general equilibrium in a two-goods market by showing that the market clearance price is actually determined by the bargaining between sellers and buyers.
In a bargaining game of incomplete or asymmetric information, different prices are possible, taking into consideration the cost of acquiring information. The analysis in this study may still be non-trivial when the bargaining game is played repeatedly or in an evolutionary context. To study the bargaining equilibrium in an evolutionary dynamic using evolutionary game theory will be a topic of our future research.

Author Contributions

Conceptualization, J.L.; Formal analysis, J.L.; Investigation, J.L. and T.C.; Methodology, J.L.; Project administration, T.C.; Supervision, G.K.; Validation, T.C. and G.K.; Writing—original draft, J.L.; Writing—review & editing, G.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Nash, J. The Bargaining Problem. Econometrica 1950, 18, 155–162. [Google Scholar] [CrossRef]
  2. Rubinstein, A. Perfect equilibrium in a bargaining model. Econometrica 1982, 50, 97–109. [Google Scholar] [CrossRef] [Green Version]
  3. Binmore, K.; Rubinstein, A.; Wolinsky, A. The Nash Bargaining Solution in Economic Modelling. RAND J. Economics 1986, 17, 176–188. [Google Scholar] [CrossRef]
  4. Stâhl, I. Bargaining Theory; Economics Research Institute: Stockholm, Sweden, 1972. [Google Scholar]
  5. Backus, M.; Blake, T.; Larsen, B.; Tadelis, S. Sequential bargaining in the field: Evidence from millions of online bargaining interactions. Q. J. Econ. 2020, 135, 1319–1361. [Google Scholar] [CrossRef] [Green Version]
  6. Haller, H. Non-cooperative bargaining of NU3 players. Econ. Lett. 1986, 22, 11–13. [Google Scholar] [CrossRef]
  7. Herrero, M. A Strategic Bargaining Approach to Market Institutions. Ph.D. Thesis, London University, London, UK, 1985. [Google Scholar]
  8. Sutton, J. Non-cooperative bargaining theory: An introduction. Rev. Econ. Stud. 1986, 53, 709–724. [Google Scholar] [CrossRef] [Green Version]
  9. Baron, D.; Ferejohn, J. Bargaining in legislatures. Am. Political Sci. Rev. 1989, 83, 1181–1206. [Google Scholar] [CrossRef] [Green Version]
  10. Asheim, G. A unique solution to n-person sequential bargaining. Games Econ. Behav. 1992, 4, 169–181. [Google Scholar] [CrossRef]
  11. Chatterjee, K.; Sabourian, H. Multiperson bargaining and strategic complexity. Econometrica 2000, 68, 1491–1509. [Google Scholar] [CrossRef]
  12. de Fontenay, C.; Gans, J. Bilateral Bargaining with Externalities; Working Paper; University of Melbourne: Melbourne, Australia, 2004. [Google Scholar]
  13. Kultti, K.; Vartiainen, H. Bargaining with many players: A limit result. Econ. Lett. 2008, 101, 249–252. [Google Scholar] [CrossRef] [Green Version]
  14. Merlo, A.; Wilson, C. A stochastic model of sequential bargaining with complete information. Econometrica 1995, 63, 371–399. [Google Scholar] [CrossRef]
  15. Vannetelbosch, V. Rationalizability and equilibrium in n-person sequential bargaining. Econ. Theory 1999, 14, 353–371. [Google Scholar] [CrossRef]
  16. Vidal-Puga, J. Bargaining with commitments. Int. Game Theory 2004, 33, 129–144. [Google Scholar] [CrossRef]
  17. Winter, E. The demand commitment bargaining and snowballing cooperation. Econ. Theory 1994, 4, 255–273. [Google Scholar] [CrossRef]
  18. Calvo-Armengo, A. A note on three-player noncooperative bargaining with restricted pairwise meetings. Econ. Lett. 1999, 65, 47–54. [Google Scholar] [CrossRef]
  19. Dasgupta, A.; Chiu, Y. On implementation via demand commitment games. Int. J. Game Theory 1998, 27, 161–189. [Google Scholar] [CrossRef]
  20. Eraslan, H.; Evdokimov, K.S. Legislative and multilateral bargaining. Annu. Rev. Econ. 2019, 11, 443–472. [Google Scholar] [CrossRef] [Green Version]
  21. Krishna, V.; Serrano, R. Multilateral bargaining. Rev. Economic Stud. 1996, 63, 61–80. [Google Scholar] [CrossRef]
  22. Yang, J. Another N-person bargaining game with a unique perfect equilibrium. Econ. Lett. 1992, 38, 275–277. [Google Scholar] [CrossRef]
  23. Chae, S.; Yang, J. The unique perfect equilibrium of an N-person bargaining game. Econ. Lett. 1988, 28, 221–223. [Google Scholar] [CrossRef]
  24. Cai, H. Delay in multilateral bargaining under complete information. J. Econ. Theory 2000, 93, 260–276. [Google Scholar] [CrossRef]
  25. Eraslan Uniqueness of stationary equilibrium payoffs in the Baron-Ferejohn model. J. Econ. Theory 2002, 103, 11–30. [CrossRef] [Green Version]
  26. Krasteva, S.; Yildirim, H. Payoff uncertainty, bargaining power, and the strategic sequencing of bilateral negotiations. RAND J. Econ. 2012, 43, 514–536. [Google Scholar] [CrossRef] [Green Version]
  27. Krasteva, S.; Yildirim, H. Strategic ignorance in sequential procurement. Am. Econ. Microecon. 2019, 11, 131–172. [Google Scholar] [CrossRef]
  28. Collard-Wexler, A.; Gowrisankaran, G.; Lee, R.S. “Nash-in-Nash” bargaining: A microfoundation for applied work. J. Political Econ. 2019, 127, 163–195. [Google Scholar] [CrossRef] [Green Version]
  29. Kawamori Player’s patience and equilibrium payoffs in the Baron-Ferejohn model. Econ. Bull. 2005, 3, 1–5.
  30. Kalandrakis Computation of equilibrium values in the Baron and Ferejohn bargaining model. Games Econ. Behav. 2015, 94, 29–38. [CrossRef]
  31. Montero Propotional payoffs in legislative bargaining with weighted voting: A characterization. Quart. J. Political Sci. 2017, 12, 325–346. [CrossRef]
  32. Osborne, M.; Rubinstein, A. Bargaining and Markets; Academic Press: Cambridge, MA, USA, 1990; ISBN 0-12-528632-5. [Google Scholar]
Figure 1. Perfect equilibrium ( x , y ) for the bargaining game of two sellers and two buyers.
Figure 1. Perfect equilibrium ( x , y ) for the bargaining game of two sellers and two buyers.
Mathematics 10 02705 g001
Figure 2. Relationship between two-player bargaining and two pairs of players bargaining.
Figure 2. Relationship between two-player bargaining and two pairs of players bargaining.
Mathematics 10 02705 g002
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Li, J.; Cui, T.; Kendall, G. Equilibrium in a Bargaining Game of Two Sellers and Two Buyers. Mathematics 2022, 10, 2705. https://doi.org/10.3390/math10152705

AMA Style

Li J, Cui T, Kendall G. Equilibrium in a Bargaining Game of Two Sellers and Two Buyers. Mathematics. 2022; 10(15):2705. https://doi.org/10.3390/math10152705

Chicago/Turabian Style

Li, Jiawei, Tianxiang Cui, and Graham Kendall. 2022. "Equilibrium in a Bargaining Game of Two Sellers and Two Buyers" Mathematics 10, no. 15: 2705. https://doi.org/10.3390/math10152705

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