The Talmud rule and the securement of agents' awards
This paper provides a new characterization of the Talmud rule by means of a new property, called securement. This property says that any agent holding a feasible claim will get at least one nht of her claim, where n is the number of agents involved. We show that securement together with a weak version of path independence and the standard properties of self-duality and consistency characterize the Talmud rule.
(This abstract was borrowed from another version of this item.)
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.:
- Antonio Villar Notario & Juan D. Moreno Ternero, 2001.
"The Tal-Family Of Rules For Bankruptcy Problems,"
Working Papers. Serie AD
2001-33, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
- Antonio Villar Notario & Carmen Herrero Blanco, 2000.
"The Three Musketeers: Four Classical Solutions To Bankruptcy Problems,"
Working Papers. Serie AD
2000-23, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
- Herrero, Carmen & Villar, Antonio, 2001. "The three musketeers: four classical solutions to bankruptcy problems," Mathematical Social Sciences, Elsevier, vol. 42(3), pages 307-328, November.
- Moulin, Herve, 2002.
"Axiomatic cost and surplus sharing,"
Handbook of Social Choice and Welfare,
in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 1, chapter 6, pages 289-357
- Thomson, W., 1996. "Consistent Allocation Rules," RCER Working Papers 418, University of Rochester - Center for Economic Research (RCER).
- Thomson, William, 2003. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey," Mathematical Social Sciences, Elsevier, vol. 45(3), pages 249-297, July.
- O'Neill, Barry, 1982. "A problem of rights arbitration from the Talmud," Mathematical Social Sciences, Elsevier, vol. 2(4), pages 345-371, June.
- Nir Dagan, 1996.
"New Characterizations of Old Bankruptcy Rules,"
Economic theory and game theory
002, Nir Dagan.
- Hervé Moulin, 2000. "Priority Rules and Other Asymmetric Rationing Methods," Econometrica, Econometric Society, vol. 68(3), pages 643-684, May.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:47:y:2004:i:2:p:245-257. 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: (Zhang, Lei)
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.