Generalized Raiffa solutions
We define a family of solutions for n-person bargaining problems which generalizes the discrete Raiffa solution and approaches the continuous Raiffa solution. Each member of this family is a stepwise solution, which is a pair of functions: a step-function that determines a new disagreement point for a given bargaining problem, and a solution function that assigns the solution to the problem. We axiomatically characterize stepwise solutions of the family of generalized Raiffa solutions, using standard axioms of bargaining theory.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Nash, John, 1950. "The Bargaining Problem," Econometrica, Econometric Society, vol. 18(2), pages 155-162, April.
- Kalai, Ehud, 1977.
"Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons,"
Econometric Society, vol. 45(7), pages 1623-1630, October.
- Ehud Kalai, 1977. "Proportional Solutions to Bargaining Situations: Interpersonal Utility Comparisons," Discussion Papers 179, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Barry O'Neill & Dov Samet & Zvi Wiener & Eyal Winter, 2001.
"Bargaining with an Agenda,"
Game Theory and Information
- Kalai, Ehud & Smorodinsky, Meir, 1975. "Other Solutions to Nash's Bargaining Problem," Econometrica, Econometric Society, vol. 43(3), pages 513-518, May.
- van Damme, E.E.C. & Peters, H., 1991. "Characterizing the Nash and Raiffa bargaining solutions by disagreement point axioms," Other publications TiSEM 4bd5eb9e-328a-45a0-aa0a-e, Tilburg University, School of Economics and Management.
- Salonen, Hannu, 1988. "Decomposable solutions for N -- person bargaining games," European Journal of Political Economy, Elsevier, vol. 4(3), pages 333-347.
- Trockel, Walter, 2011.
"An exact non-cooperative support for the sequential Raiffa solution,"
Center for Mathematical Economics Working Papers
426, Center for Mathematical Economics, Bielefeld University.
- Trockel, Walter, 2011. "An exact non-cooperative support for the sequential Raiffa solution," Journal of Mathematical Economics, Elsevier, vol. 47(1), pages 77-83, January.
- Thomson, William, 1987. "Monotonicity of bargaining solutions with respect to the disagreement point," Journal of Economic Theory, Elsevier, vol. 42(1), pages 50-58, June.
When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:73:y:2011:i:2:p:452-458. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.