Fair (and not so fair) division
AbstractNo abstract is available for this item.
Download InfoIf 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.
Bibliographic InfoArticle provided by Springer in its journal Journal of Risk and Uncertainty.
Volume (Year): 35 (2007)
Issue (Month): 3 (December)
Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=100299
Fair division; Geometric-mean prices; Efficient allocation; Envy-free; Spite; Bargaining solutions; C78; D63;
Find related papers by JEL classification:
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
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 & Smorodinsky, Meir, 1975. "Other Solutions to Nash's Bargaining Problem," Econometrica, Econometric Society, vol. 43(3), pages 513-18, May.
- John W. Pratt, 2008. "Some neglected axioms in fair division," Harvard Business School Working Papers 08-094, Harvard Business School.
- Aase, Knut K., 2008. "The Nash Bargaining Solution vs. Equilibrium in a Reinsurance Syndicate," Discussion Papers 2008/5, Department of Business and Management Science, Norwegian School of Economics.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F. Baum).
If references are entirely missing, you can add them using this form.