Skip to main content Accessibility help
×
Hostname: page-component-77c89778f8-m42fx Total loading time: 0 Render date: 2024-07-16T23:09:44.219Z Has data issue: false hasContentIssue false
This chapter is part of a book that is no longer available to purchase from Cambridge Core

15 - Bargaining games

Michael Maschler
Affiliation:
Hebrew University of Jerusalem
Eilon Solan
Affiliation:
Tel-Aviv University
Shmuel Zamir
Affiliation:
Hebrew University of Jerusalem
Get access

Summary

Chapter summary

In this chapter we present bargaining games, which model situations in which two or more players bargain toward an agreed-upon outcome. The set of all possible outcomes is called the feasible set and each outcome can be attained only by the unanimous agreement of all players. Different players typically prefer different outcomes, which explains the bargaining aspect of the model. A default outcome, called the disagreement point, is realized if the players fail to reach an agreement.

A solution concept for bargaining games is a function that assigns to every bargaining game an outcome that can be looked at as the outcome that would be recommended to the players by an arbitrator or a judge. We list several desirable properties that a solution concept for two-player bargaining games could satisfy and provide the unique solution concept that satisfies all these properties, namely, the Nash solution for bargaining games. Variants of the Nash solution, like the Kalai–Smorodinsky solution, are obtained by imposing a different set of properties that a solution concept should satisfy. Finally, the model and some of the results are extended to bargaining games with more than two players.

It is frequently the case that two (or more) parties conduct negotiations over an issue, with the payoff to each party dependent on the outcome of the negotiation process. Examples include negotiations between employers and employees on working conditions, nations negotiating trade treaties, and company executives negotiating corporate mergers and acquisitions.

Type
Chapter
Information
Game Theory , pp. 622 - 658
Publisher: Cambridge University Press
Print publication year: 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×