We consider the problem of sharing a good, where agents prefer more to less. In this environment, we prove that a sharing rule satisfies strategy-proofness if and only if it has the quasi-constancy property:no one changes her own share by changing her announcements. Next,by constructing a system of linear equations, we provide a way to find every strategy-proof sharing rule, and identify a necessary and sufficient condition for the existence of a non-constant, strategy-proof sharing rule. Finally, we show that it is only the equal-sharing rule that satisfies strategy-proofness and symmetry.
|Date of creation:||Aug 2003|
|Date of revision:|
|Contact details of provider:|| Postal: 11th floor, Annex, Ministry of Economy, Trade and Industry (METI) 1-3-1, Kasumigaseki Chiyoda-ku, Tokyo, 100-8901|
Web page: http://www.rieti.go.jp/
More information through EDIRC
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.:
- Sprumont, Yves, 1991. "The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule," Econometrica, Econometric Society, vol. 59(2), pages 509-19, March.
- Tatsuyoshi Saijo & Tomas Sjostrom & Takehiko Yamato, 2005.
Economics Working Papers
0056, Institute for Advanced Study, School of Social Science.
- Barbera, Salvador & Jackson, Matthew O. & Neme, Alejandro, 1997.
"Strategy-Proof Allotment Rules,"
Games and Economic Behavior,
Elsevier, vol. 18(1), pages 1-21, January.
- Hideki Mizukami & Tatsuyoshi Saijo & Takuma Wakayama, 2003.
03017, Research Institute of Economy, Trade and Industry (RIETI).
- Hideki Mizukami & Tatsuyoshi Saijo & Takuma Wakayama, 2005. "Strategy-proof Sharing," Discussion Papers in Economics and Business 05-05, Osaka University, Graduate School of Economics and Osaka School of International Public Policy (OSIPP).
- Mizukami, Hideki & Saijo, Tatsuyoshi & Wakayama, Takuma, 2003. "Strategy-Proof Sharing," Working Papers 1170, California Institute of Technology, Division of the Humanities and Social Sciences.
- Satterthwaite, Mark Allen, 1975. "Strategy-proofness and Arrow's conditions: Existence and correspondence theorems for voting procedures and social welfare functions," Journal of Economic Theory, Elsevier, vol. 10(2), pages 187-217, April.
- Barbera, Salvador & Jackson, Matthew O, 1995.
Econometric Society, vol. 63(1), pages 51-87, January.
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," Review of Economic Studies, Oxford University Press, vol. 66(1), pages 23-38.
- Mark A. Satterthwaite & Hugo Sonnenschein, 1981. "Strategy-Proof Allocation Mechanisms at Differentiable Points," Review of Economic Studies, Oxford University Press, vol. 48(4), pages 587-597.
- Gibbard, Allan, 1973. "Manipulation of Voting Schemes: A General Result," Econometrica, Econometric Society, vol. 41(4), pages 587-601, July.
- repec:spr:pharme:v:22:y:2004:i:4:p:225-244 is not listed on IDEAS
- Miki Kato & Shinji Ohseto, 2002. "Toward general impossibility theorems in pure exchange economies," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 19(3), pages 659-664.
- Lin Zhou, 1990. "Inefficiency of Strategy-Proof Allocation Mechanisms in Pure Exchange Economies," Cowles Foundation Discussion Papers 954, Cowles Foundation for Research in Economics, Yale University.
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
When requesting a correction, please mention this item's handle: RePEc:eti:dpaper:03017. 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: (NUKATANI Sorahiko)
If references are entirely missing, you can add them using this form.