Cooperative bargaining

Problem in process of sharing surplus

Cooperative bargaining is a process in which two people decide how to share a surplus that they can jointly generate. In many cases, the surplus created by the two players can be shared in many ways, forcing the players to negotiate which division of payoffs to choose. Such surplus-sharing problems (also called bargaining problem) are faced by management and labor in the division of a firm's profit, by trade partners in the specification of the terms of trade, and more.

The present article focuses on the normative approach to bargaining. It studies how the surplus should be shared, by formulating appealing axioms that the solution to a bargaining problem should satisfy. It is useful when both parties are willing to cooperate in implementing the fair solution. Such solutions, particularly the Nash solution, were used to solve concrete economic problems, such as management–labor conflicts, on numerous occasions.[1]

An alternative approach to bargaining is the positive approach. It studies how the surplus is actually shared. Under the positive approach, the bargaining procedure is modeled as a non-cooperative game. The most common form of such game is called sequential bargaining.

## Formal description

[edit]

A two-person bargain problem consists of:

* A feasibility set  F {\displaystyle F} , a closed subset of  R 2 {\displaystyle \mathbb {R} ^{2}} that is often assumed to be convex, the elements of which are interpreted as agreements.
* A disagreement, or threat, point  d = ( d 1 , d 2 ) {\displaystyle d=(d_{1},d_{2})} , where  d 1 {\displaystyle d_{1}} and  d 2 {\displaystyle d_{2}} are the respective payoffs to player 1 and player 2, which they are guaranteed to receive if they cannot come to a mutual agreement.

The problem is nontrivial if agreements in  F {\displaystyle F} are better for both parties than the disagreement point. A solution to the bargaining problem selects an agreement  ϕ {\displaystyle \phi } in  F {\displaystyle F} .

### Feasibility set

[edit]

The feasible agreements typically include all possible joint actions, leading to a feasibility set that includes all possible payoffs. Often, the feasible set is restricted to include only payoffs that have a possibility of being better than the disagreement point for both agents.[2]

### Disagreement point

[edit]

The disagreement point  d {\displaystyle d} is the value the players can expect to receive if negotiations break down. This could be some focal equilibrium that both players could expect to play, or zero if no agreement is reached. This point directly affects the bargaining solution, however, so it stands to reason that each player should attempt to choose his disagreement point in order to maximize his bargaining position. Towards this objective, it is often advantageous to increase one's own disagreement payoff while harming the opponent's disagreement payoff (hence the interpretation of the disagreement as a threat). If threats are viewed as actions, then one can construct a separate game wherein each player chooses a threat and receives a payoff according to the outcome of bargaining. It is known as Nash's variable threat game.

## Nash bargaining game

[edit]

John Forbes Nash Jr. came up with the Nash bargaining solution. It is the unique solution to a two-person bargaining problem that satisfies the axioms of scale invariance, symmetry, efficiency, and independence of irrelevant alternatives. According to Paul Walker,[3] Nash's bargaining solution was shown by John Harsanyi to be the same as Zeuthen's solution[4] of the bargaining problem.

The Nash bargaining game is a simple two-player game used to model bargaining interactions. In the Nash bargaining game, two players demand a portion of some good (usually some amount of money). If the total amount requested by the players is less than that available, both players get their request. If their total request is greater than that available, neither player gets their request.

Nash (1953) presents a non-cooperative demand game with two players who are uncertain about which payoff pairs are feasible. In the limit as the uncertainty vanishes, equilibrium payoffs converge to those predicted by the Nash bargaining solution.[2]

## Equilibrium analysis

[edit]

Strategies are represented in the Nash demand game by a pair (x, y). x and y are selected from the interval [d, z], where d is the disagreement outcome and z is the total amount of good. If x \+ y is equal to or less than z, the first player receives x and the second y. Otherwise both get d; often  d = 0 {\displaystyle d=0} .

There are many Nash equilibria in the Nash demand game. Any x and y such that x \+ y = z is a Nash equilibrium. If either player increases their demand, both players receive nothing. If either reduces their demand they will receive less than if they had demanded x or y. There is also a Nash equilibrium where both players demand the entire good. Here both players receive nothing, but neither player can increase their return by unilaterally changing their strategy.

In Rubinstein's alternating offers bargaining game,[5] players take turns acting as the proposer for splitting some surplus. The division of the surplus in the unique subgame perfect equilibrium depends upon how strongly players prefer current over future payoffs. In particular, let d be the discount factor, which refers to the rate at which players discount future earnings. That is, after each step the surplus is worth d times what it was worth previously. Rubinstein showed that if the surplus is normalized to 1, the payoff for player 1 in equilibrium is 1/(1+d), while the payoff for player 2 is d/(1+d). In the limit as players become perfectly patient, the equilibrium division converges to the Nash bargaining solution.

## Bargaining solutions

[edit]

Various solutions have been proposed based on slightly different assumptions about what properties are desired for the final agreement point.

### Nash bargaining solution

[edit]

John Forbes Nash Jr. proposed that a solution should satisfy certain axioms:[6]

1. Invariant to affine transformations or Invariant to equivalent utility representations
2. Pareto optimality
3. Independence of irrelevant alternatives
4. Symmetry

Nash proved that the solutions satisfying these axioms are exactly the points  ( x , y ) {\displaystyle (x,y)} in  F {\displaystyle F} which maximize the following expression:

( u ( x ) − u ( d ) ) ( v ( y ) − v ( d ) ) {\displaystyle (u(x)-u(d))(v(y)-v(d))}

where u and v are the utility functions of Player 1 and Player 2, respectively, and d is a disagreement outcome. That is, players act as if they seek to maximize  ( u ( x ) − u ( d ) ) ( v ( y ) − v ( d ) ) {\displaystyle (u(x)-u(d))(v(y)-v(d))} , where  u ( d ) {\displaystyle u(d)} and  v ( d ) {\displaystyle v(d)} , are the status quo utilities (the utility obtained if one decides not to bargain with the other player). The product of the two excess utilities is generally referred to as the Nash product. Intuitively, the solution consists of each player getting their status quo payoff (i.e. noncooperative payoff) in addition to a share of the benefits occurring from cooperation.[7]: 15–16

### Kalai–Smorodinsky bargaining solution

[edit]

Main article: Kalai–Smorodinsky bargaining solution

Independence of irrelevant alternatives can be substituted with a resource monotonicity axiom, as suggested by Ehud Kalai and Meir Smorodinsky.[8] This leads to the Kalai–Smorodinsky rule, which selects the point which maintains the ratio of maximal gains. In other words, if we normalize the disagreement point to (0,0) and player 1 can receive a maximum of  g 1 {\displaystyle g_{1}} with player 2's help (and vice versa for  g 2 {\displaystyle g_{2}} ), then the Kalai–Smorodinsky bargaining solution would yield the point  ϕ {\displaystyle \phi } on the Pareto frontier such that  ϕ 1 / ϕ 2 = g 1 / g 2 {\displaystyle \phi _{1}/\phi _{2}=g_{1}/g_{2}} .

### Egalitarian bargaining solution

[edit]

The egalitarian bargaining solution, introduced by Ehud Kalai, is a third solution which drops the condition of scale invariance while including both the axiom of independence of irrelevant alternatives, and the axiom of resource monotonicity. It is the solution which attempts to grant equal gain to both parties. In other words, it is the point which maximizes the minimum payoff among players. Kalai notes that this solution is closely related to the egalitarian ideas of John Rawls.[9]

### Comparison table

[edit]

Name | Pareto-optimality | Symmetry | Scale-invariance | Irrelevant-independence | Resource-monotonicity | Principle

|
|
|
|
|
|

Proportional-fair rule |  |  |  |  |  | Maximizing the product of surplus utilities
Kalai–Smorodinsky rule |  |  |  |  |  | Equalizing the ratios of maximal gains
Egalitarian rule |  |  |  |  |  | Maximizing the minimum of surplus utilities

## Experimental solutions

[edit]

A series of experimental studies[10] found no consistent support for any of the bargaining models. Although some participants reached results similar to those of the models, others did not, focusing instead on conceptually easy solutions beneficial to both parties. The Nash equilibrium was the most common agreement (mode), but the average (mean) agreement was closer to a point based on expected utility.[11] In real-world negotiations, participants often first search for a general bargaining formula, and then only work out the details of such an arrangement, thus precluding the disagreement point and instead moving the focal point to the worst possible agreement.

## Applications

[edit]

Kenneth Binmore has used the Nash bargaining game to explain the emergence of human attitudes toward distributive justice.[12][13] He primarily uses evolutionary game theory to explain how individuals come to believe that proposing a 50–50 split is the only just solution to the Nash bargaining game. Herbert Gintis supports a similar theory, holding that humans have evolved to a predisposition for strong reciprocity but do not necessarily make decisions based on direct consideration of utility.[14]

## Bargaining solutions and risk-aversion

[edit]

Some economists have studied the effects of risk aversion on the bargaining solution. Compare two similar bargaining problems A and B, where the feasible space and the utility of player 1 remain fixed, but the utility of player 2 is different: player 2 is more risk-averse in A than in B. Then, the payoff of player 2 in the Nash bargaining solution is smaller in A than in B.[15]: 303–304 However, this is true only if the outcome itself is certain; if the outcome is risky, then a risk-averse player may get a better deal as proved by Alvin E. Roth and Uriel Rothblum.[16]

## See also

[edit]

* Bargaining
* Core (game theory)
* Rubinstein bargaining model
* Sequential bargaining
* Nash equilibrium
* Ultimatum game

## References

[edit]

1. ^ Thomson, William (1994-01-01), "Chapter 35 Cooperative models of bargaining", Handbook of Game Theory with Economic Applications, vol. 2, Elsevier, pp. 1237–1284, retrieved 2021-02-051237-1284&rft.date=1994-01-01&rft.aulast=Thomson&rft.aufirst=William&rft_id=https://www.sciencedirect.com/science/article/pii/S1574000505800670&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
2. ^ a b Nash, John (1953-01-01). "Two-Person Cooperative Games". Econometrica. 21 (1): 128–140\. doi:10.2307/1906951. JSTOR 1906951.128-140&rft.date=1953-01-01&rft_id=info:doi/10.2307/1906951&rft_id=https://www.jstor.org/stable/1906951#id-name=JSTOR&rft.aulast=Nash&rft.aufirst=John&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
3. ^ Walker, Paul (2005). "History of Game Theory". Archived from the original on 2000-08-15. Retrieved 2008-05-03.
4. ^ Zeuthen, Frederik (1930). Problems of Monopoly and Economic Warfare.
5. ^ Rubinstein, Ariel (1982-01-01). "Perfect Equilibrium in a Bargaining Model". Econometrica. 50 (1): 97–109\. CiteSeerX 10.1.1.295.1434. doi:10.2307/1912531. JSTOR 1912531. S2CID 14827857.97-109&rft.date=1982-01-01&rft_id=https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.1434#id-name=CiteSeerX&rft_id=https://api.semanticscholar.org/CorpusID:14827857#id-name=S2CID&rft_id=https://www.jstor.org/stable/1912531#id-name=JSTOR&rft_id=info:doi/10.2307/1912531&rft.aulast=Rubinstein&rft.aufirst=Ariel&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
6. ^ Nash, John (1950). "The Bargaining Problem". Econometrica. 18 (2): 155–162\. doi:10.2307/1907266. JSTOR 1907266. S2CID 153422092.155-162&rft.date=1950&rft_id=https://api.semanticscholar.org/CorpusID:153422092#id-name=S2CID&rft_id=https://www.jstor.org/stable/1907266#id-name=JSTOR&rft_id=info:doi/10.2307/1907266&rft.aulast=Nash&rft.aufirst=John&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
7. ^ Muthoo, Abhinay (1999). Bargaining theory with applications. Cambridge University Press.
8. ^ Kalai, Ehud & Smorodinsky, Meir (1975). "Other solutions to Nash's bargaining problem". Econometrica. 43 (3): 513–518\. doi:10.2307/1914280. JSTOR 1914280.513-518&rft.date=1975&rft_id=info:doi/10.2307/1914280&rft_id=https://www.jstor.org/stable/1914280#id-name=JSTOR&rft.aulast=Kalai&rft.aufirst=Ehud&rft.au=Smorodinsky,+Meir&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
9. ^ Kalai, Ehud (1977). "Proportional solutions to bargaining situations: Intertemporal utility comparisons" (PDF). Econometrica. 45 (7): 1623–1630\. doi:10.2307/1913954. JSTOR 1913954.1623-1630&rft.date=1977&rft_id=info:doi/10.2307/1913954&rft_id=https://www.jstor.org/stable/1913954#id-name=JSTOR&rft.aulast=Kalai&rft.aufirst=Ehud&rft_id=http://www.kellogg.northwestern.edu/research/math/papers/179.pdf&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
10. ^ Schellenberg, James A. (1 January 1990). "'Solving' the Bargaining Problem" (PDF). Mid-American Review of Sociology. 14 (1/2): 77–88. Retrieved 28 January 2017.77-88&rft.date=1990-01-01&rft.aulast=Schellenberg&rft.aufirst=James+A.&rft_id=https://kuscholarworks.ku.edu/bitstream/handle/1808/5046/MARSV14N1-2A7.pdf?sequence=1&isAllowed;=y&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
11. ^ Felsenthal, D. S.; Diskin, A. (1982). "The Bargaining Problem Revisited: Minimum Utility Point, Restricted Monotonicity Axiom, and the Mean as an Estimate of Expected Utility". Journal of Conflict Resolution. 26 (4): 664–691\. doi:10.1177/0022002782026004005. S2CID 154770122.664-691&rft.date=1982&rft_id=info:doi/10.1177/0022002782026004005&rft_id=https://api.semanticscholar.org/CorpusID:154770122#id-name=S2CID&rft.aulast=Felsenthal&rft.aufirst=D.+S.&rft.au=Diskin,+A.&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
12. ^ Binmore, Kenneth (1998). Game Theory and the Social Contract Volume 2: Just Playing. Cambridge: MIT Press. ISBN 978-0-262-02444-0.
13. ^ Binmore, Kenneth (2005). Natural Justice. New York: Oxford University Press. ISBN 978-0-19-517811-1.
14. ^ Gintis, H. (11 August 2016). "Behavioral ethics meets natural justice". Politics, Philosophy & Economics. 5 (1): 5–32\. doi:10.1177/1470594x06060617. S2CID 19601647.5-32&rft.date=2016-08-11&rft_id=info:doi/10.1177/1470594x06060617&rft_id=https://api.semanticscholar.org/CorpusID:19601647#id-name=S2CID&rft.aulast=Gintis&rft.aufirst=H.&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">
15. ^ Osborne, Martin (1994). A Course in Game Theory. MIT Press. ISBN 978-0-262-15041-5.
16. ^ Roth, Alvin E.; Rothblum, Uriel G. (1982). "Risk Aversion and Nash's Solution for Bargaining Games with Risky Outcomes". Econometrica. 50 (3): 639. doi:10.2307/1912605. JSTOR 1912605.

* Binmore, K.; Rubinstein, A.; Wolinsky, A. (1986). "The Nash Bargaining Solution in Economic Modelling". RAND Journal of Economics. 17 (2): 176–188\. doi:10.2307/2555382. JSTOR 2555382.176-188&rft.date=1986&rft_id=info:doi/10.2307/2555382&rft_id=https://www.jstor.org/stable/2555382#id-name=JSTOR&rft.aulast=Binmore&rft.aufirst=K.&rft.au=Rubinstein,+A.&rft.au=Wolinsky,+A.&rfr_id=info:sid/en.wikipedia.org:Cooperative+bargaining" class="Z3988">

## External links

[edit]

* Nash bargaining solutions

* v
* t
* e

Topics of game theory

Definitions|

* Congestion game
* Cooperative game
* Determinacy
* Escalation of commitment
* Extensive-form game
* First-player and second-player win
* Game complexity
* Graphical game
* Hierarchy of beliefs
* Information set
* Normal-form game
* Perfect recall
* Preference
* Sequential game
* Simultaneous game
* Simultaneous action selection
* Solved game
* Succinct game
* Mechanism design

Equilibrium
concepts|

* Bayes correlated equilibrium
* Bayesian Nash equilibrium
* Berge equilibrium
* Core
* Correlated equilibrium
* Coalition-proof Nash equilibrium
* Epsilon-equilibrium
* Evolutionarily stable strategy
* Gibbs equilibrium
* Mertens-stable equilibrium
* Markov perfect equilibrium
* Nash equilibrium
* Pareto efficiency
* Perfect Bayesian equilibrium
* Proper equilibrium
* Quantal response equilibrium
* Quasi-perfect equilibrium
* Risk dominance
* Satisfaction equilibrium
* Self-confirming equilibrium
* Sequential equilibrium
* Shapley value
* Strong Nash equilibrium
* Subgame perfection
* Trembling hand equilibrium

Strategies|

* Appeasement
* Backward induction
* Bid shading
* Collusion
* Cheap talk
* De-escalation
* Deterrence
* Escalation
* Forward induction
* Grim trigger
* Markov strategy
* Pairing strategy
* Dominant strategies
* Pure strategy
* Mixed strategy
* Strategy-stealing argument
* Tit for tat

Classes
of games|

* Auction
* Bargaining problem
* Differential game
* Global game
* Intransitive game
* Mean-field game
* n-player game
* Perfect information
* Large Poisson game
* Potential game
* Repeated game
* Screening game
* Signaling game
* Strictly determined game
* Stochastic game
* Symmetric game
* Zero-sum game

Games|

* Go
* Chess
* Infinite chess
* Checkers
* All-pay auction
* Prisoner's dilemma
* Gift-exchange game
* Optional prisoner's dilemma
* Traveler's dilemma
* Coordination game
* Chicken
* Centipede game
* Lewis signaling game
* Volunteer's dilemma
* Dollar auction
* Battle of the sexes
* Stag hunt
* Matching pennies
* Ultimatum game
* Electronic mail game
* Rock paper scissors
* Pirate game
* Dictator game
* Public goods game
* Blotto game
* War of attrition
* El Farol Bar problem
* Fair division
* Fair cake-cutting
* Bertrand competition
* Cournot competition
* Stackelberg competition
* Deadlock
* Diner's dilemma
* Guess 2/3 of the average
* Kuhn poker
* Nash bargaining game
* Induction puzzles
* Trust game
* Princess and monster game
* Rendezvous problem
* Pursuit game

Theorems|

* Aumann's agreement theorem
* Folk theorem
* Minimax theorem
* Nash's theorem
* Negamax theorem
* One-shot deviation principle
* Purification theorem
* Revelation principle
* Sprague–Grundy theorem
* Zermelo's theorem

Key
figures|

* Albert W. Tucker
* Amos Tversky
* Antoine Augustin Cournot
* Ariel Rubinstein
* Claude Shannon
* Daniel Kahneman
* David K. Levine
* David M. Kreps
* Donald B. Gillies
* Drew Fudenberg
* Eric Maskin
* Harold W. Kuhn
* Herbert Simon
* Hervé Moulin
* John Conway
* Jean Tirole
* Jean-François Mertens
* Jennifer Tour Chayes
* John Harsanyi
* John Maynard Smith
* John Nash
* John von Neumann
* Kenneth Arrow
* Kenneth Binmore
* Leonid Hurwicz
* Lloyd Shapley
* Melvin Dresher
* Merrill M. Flood
* Olga Bondareva
* Oskar Morgenstern
* Paul Milgrom
* Peyton Young
* Reinhard Selten
* Robert Axelrod
* Robert Aumann
* Robert B. Wilson
* Roger Myerson
* Samuel Bowles
* Suzanne Scotchmer
* Thomas Schelling
* William Vickrey

Search optimizations|

* Alpha–beta pruning
* Aspiration window
* Principal variation search
* max^n algorithm
* Paranoid algorithm
* Lazy SMP

Miscellaneous|

* Bounded rationality
* Combinatorial game theory
* Confrontation analysis
* Coopetition
* Evolutionary game theory
* Glossary of game theory
* List of game theorists
* List of games in game theory
* No-win situation
* Topological game
* Tragedy of the commons

Authority control databases: National |

* Germany

|

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template