Nash bargaining game

From Wikipedia, the free encyclopedia

(Redirected from Nash bargaining solution)
Jump to: navigation, search

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 Forbes Nash in his 1950 paper "The Bargaining Problem". 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.

Contents

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 d = 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.

On the other hand, Nash proposed that a solution should satisfy certain axioms, 1) Invariant to affine transformations or Invariant to equivalent utility representations, 2) Pareto optimality, 3) Independence of irrelevant alternatives, 4) Symmetry. 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 | u(x) − u(d) | | v(y) − v(d) | , where u(d) and v(d), 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.

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 and Brian Skyrms (1999) "Bargaining with Neighbors: Is Justice Contagious" Journal of Philosophy 96(11): 588-598.
  • Binmore, K., Rubinstein, A. & Wolinsky, A. (1986). The Nash Bargaining Solution in Economic Modelling. RAND Journal of Economics 17:176-188.
  • 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.
  • Walker, Paul (2005) History of Game Theory. http://www.econ.canterbury.ac.nz/personal_pages/paul_walker/gt/hist.htm#ref94


 view  Topics in game theory

Definitions

Normal form game · Extensive form game · Cooperative game · Information set · Preference

Equilibrium concepts

Nash equilibrium · Subgame perfection · Bayesian-Nash · Perfect Bayesian · Trembling hand · Proper equilibrium · Epsilon-equilibrium · Correlated equilibrium · Sequential equilibrium · Quasi-perfect equilibrium · Evolutionarily stable strategy · Risk dominance

Strategies

Dominant strategies · Mixed strategy · Tit for tat · Grim trigger · Collusion

Classes of games

Symmetric game · Perfect information · Dynamic game · Repeated game · Signaling game · Cheap talk · Zero-sum game · Mechanism design · Stochastic game · Nontransitive game

Games

Prisoner's dilemma · Traveler's dilemma · Coordination game · Chicken · Volunteer's dilemma · Dollar auction · Battle of the sexes · Stag hunt · Matching pennies · Ultimatum game · Minority game · Rock, Paper, Scissors · Pirate game · Dictator game · Public goods game · Nash bargaining game · Blotto games  · War of attrition

Theorems

Minimax theorem · Purification theorems · Folk theorem · Revelation principle · Arrow's theorem

Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.