Nash bargaining game

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 two proposals sum to no more than the total good, then both players get their demand. Otherwise, both get nothing. This game was first suggested by John Nash in his 1950 paper "The Bargaining Problem".

Equilibrium Analysis

Strategies are represented in the Nash Bargaining Game by an pair (x, y). x and y are selected from the interval [0, z], where z is the total good. If x+y is equal to or less than z, the first player receives x and the second y. Otherwise both get 0.

There are many Nash equilibria in the Nash Bargaining 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 had they 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.

Applications

Recently the Nash Bargaining Game has been used by some philosophers and economists in order to explain the emergence of human attitudes toward distributive justice (Alexander 2000; Alexander and Skyrms 1999; Binmore 1998, 2005). These authors primarily use evolutionary game theory in order to explain how individuals come to believe that proposing a 50-50 split is the only just solution to the Nash Bargaining Game.

References

Alexander, Jason McKenzie (2000) "Evolutionary Explanations of Distributive Justice." Philosophy of Science 67: 490-516.

Alexander, Jason and Brian Skyrms (1999) "Bargaining with Neighbors: Is Justice Contagious" Journal of Philosophy 96(11): 588-598.

Binmore, Kenneth (1998) Game Theory and The Social Contract Volume 2: Just Playing Cambridge: MIT Press.

Binmore, Kenneth (2005) Natural Justice

Nash, John (1950) "The Bargaining Problem" Econometrica 18: 155-162.

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 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 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
Theorems	Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Negamax theorem 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

Equilibrium Analysis

Applications

See also

References