Individual differences |
Methods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |
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. A Nash bargaining solution is a (Pareto efficient) solution to a Nash bargaining game. According to Walker (2005), Nash's bargaining solution was shown to be the same (by John Harsanyi) as Zeuthen's 1930 solution of the bargaining problem published in the book Problems of Monopoly and Economic Warfare.
Equilibrium analysis Edit
Strategies are represented in the Nash bargaining game by a pair (x, y). x and y are selected from the interval [d, 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 d. d here represents the disagreement point or the threat of the game; often .
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 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.
Nash bargaining solution Edit
On the other hand, Nash proposed that a solution should satisfy certain axioms:
- Invariant to affine transformations or Invariant to equivalent utility representations
- Pareto optimality
- Independence of irrelevant alternatives
Let us call u the utility function for player 1, v the utility function for player 2. Under these conditions, rational agents will choose what is known as the Nash bargaining solution. Namely, they will seek to maximize , where and , are the status quo utilities (i.e. the utiltity 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.
Other solution: Monotonicity condition Edit
Independence of Irrelevant Alternatives can be substituted with an appropriate monotonicity condition, thus providing a different solution for the class of bargaining problems. This alternative solution has been introduced by E. Kalai and M. Smorodinsky.
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.
- Alexander, Jason McKenzie (2000). Evolutionary Explanations of Distributive Justice. Philosophy of Science 67: 490–516.
- Alexander, Jason, Skyrms, Brian (1999). Bargaining with Neighbors: Is Justice Contagious. Journal of Philosophy 96 (11): 588–598.
- Binmore, Kenneth, Rubinstein, A.; Wolinsky, A. (1986). The Nash Bargaining Solution in Economic Modelling. RAND Journal of Economics 17 (2): 176–188.
- Binmore, Kenneth (1998). Game Theory and The Social Contract Volume 2: Just Playing, Cambridge: MIT Press.
- Binmore, Kenneth (2005). Natural Justice.
- Kalai, Ehud, Smorodinsky, Meir (1975). Other solutions to Nash’s bargaining problem. Econometrica 43 (3): 513–518.
- Nash, John (1950). The Bargaining Problem. Econometrica 18 (2): 155–162.
- Roth, A. E. Axiomatic Models of Bargaining, Lecture Notes in Economics and Mathematical Systems #170, Springer Verlag, 1979. http://kuznets.fas.harvard.edu/~aroth/Axiomatic_Models_of_Bargaining.pdf
- Walker, Paul (2005) History of Game Theory. http://www.econ.canterbury.ac.nz/personal_pages/paul_walker/gt/hist.htm#ref94
|This page uses Creative Commons Licensed content from Wikipedia (view authors).|