IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v100y2019icp13-15.html
   My bibliography  Save this article

How to share a cake with a secret agent

Author

Listed:
  • Chèze, Guillaume

Abstract

In this note we study a problem of fair division in the absence of full information. We give an algorithm that solves the following problem: n≥2 persons want to cut a cake into n shares so that each person will get at least 1∕n of the cake for his or her own measure, furthermore the preferences of one person are secret. How can we construct such shares? Our algorithm is a slight modification of the Even–Paz algorithm and allows to give a connected part to each agent. Moreover, the number of cuts used during the algorithm is optimal: O(nlog(n)).

Suggested Citation

  • Chèze, Guillaume, 2019. "How to share a cake with a secret agent," Mathematical Social Sciences, Elsevier, vol. 100(C), pages 13-15.
    • Handle: RePEc:eee:matsoc:v:100:y:2019:i:c:p:13-15
    DOI: 10.1016/j.mathsocsci.2019.04.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489619300290
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2019.04.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:100:y:2019:i:c:p:13-15. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.