Advanced Search
MyIDEAS: Login to save this article or follow this journal

A Solomonic solution to the problem of assigning a private indivisible good

Contents:

Author Info

  • Athanasiou, Efthymios
Registered author(s):

    Abstract

    A benevolent Planner wishes to assign an indivisible private good to n claimants, each valuing the object differently. Individuals have quasi-linear preferences. Therefore, the possibility of transfers is allowed. A second-best efficient mechanism is a strategy-proof and anonymous mechanism that is not Pareto dominated by another strategy-proof and anonymous mechanism. In this context, we identify three conditions that are necessary and, together with Voluntary Participation, sufficient for a mechanism to be second-best efficient. This set includes mechanisms that destroy the good at certain profiles. For domains comprising two individuals we provide an explicit characterization of the family of second-best efficient mechanisms.

    Download Info

    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.
    File URL: http://www.sciencedirect.com/science/article/pii/S0899825613001097
    Download Restriction: Full text for ScienceDirect subscribers only

    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.

    Bibliographic Info

    Article provided by Elsevier in its journal Games and Economic Behavior.

    Volume (Year): 82 (2013)
    Issue (Month): C ()
    Pages: 369-387

    as in new window
    Handle: RePEc:eee:gamebe:v:82:y:2013:i:c:p:369-387

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/inca/622836

    Related research

    Keywords: Indivisible private good; Quasi-linear preferences; Strategy-Proofness; Vickrey–Clarke–Groves mechanism;

    Find related papers by JEL classification:

    References

    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.:
    as in new window
    1. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, 03.
    2. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    3. Maniquet, François & Sprumont, Yves, 2010. "Sharing the cost of a public good: An incentive-constrained axiomatic approach," Games and Economic Behavior, Elsevier, vol. 68(1), pages 275-302, January.
    4. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
    5. Sprumont, Yves, 2013. "Constrained-optimal strategy-proof assignment: Beyond the Groves mechanisms," Journal of Economic Theory, Elsevier, vol. 148(3), pages 1102-1121.
    6. Moulin, Herve & Shenker, Scott, 1992. "Serial Cost Sharing," Econometrica, Econometric Society, vol. 60(5), pages 1009-37, September.
    7. Bailey, Martin J, 1997. " The Demand Revealing Process: To Distribute the Surplus," Public Choice, Springer, vol. 91(2), pages 107-26, April.
    8. Tadenuma Koichi & Thomson William, 1995. "Games of Fair Division," Games and Economic Behavior, Elsevier, vol. 9(2), pages 191-204, May.
    9. Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-44, September.
    10. Olszewski, Wojciech, 2004. "Coalition strategy-proof mechanisms for provision of excludable public goods," Games and Economic Behavior, Elsevier, vol. 46(1), pages 88-114, January.
    11. Moulin, Herve, 1994. "Serial Cost-Sharing of Excludable Public Goods," Review of Economic Studies, Wiley Blackwell, vol. 61(2), pages 305-25, April.
    12. Moulin, Hervé, 2009. "Almost budget-balanced VCG mechanisms to assign multiple objects," Journal of Economic Theory, Elsevier, vol. 144(1), pages 96-119, January.
    13. Itai Ashlagi & Shigehiro Serizawa, 2012. "Characterizing Vickrey allocation rule by anonymity," Social Choice and Welfare, Springer, vol. 38(3), pages 531-542, March.
    14. Murat Atlamaz & Duygu Yengin, 2008. "Fair Groves mechanisms," Social Choice and Welfare, Springer, vol. 31(4), pages 573-587, December.
    15. Schummer, James, 2000. "Eliciting Preferences to Assign Positions and Compensation," Games and Economic Behavior, Elsevier, vol. 30(2), pages 293-318, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:82:y:2013:i:c:p:369-387. 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.