Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Truthful Fair Division

  • Conference paper
Algorithmic Game Theory (SAGT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6386))

Included in the following conference series:

Abstract

We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanisms. In the case of a general measure space (“cake”) and non-atomic, additive individual preference measures - or utilities - we show that there exists a truthful “mechanism” which ensures that each of the k players gets at least 1/k of the cake. This mechanism also minimizes risk for truthful players. Furthermore, in the case where there exist at least two different measures we present a different truthful mechanism which ensures that each of the players gets more than 1/k of the cake.

We then turn our attention to partitions of indivisible goods with bounded utilities and a large number of goods. Here we provide similar mechanisms, but with slightly weaker guarantees. These guarantees converge to those obtained in the non-atomic case as the number of goods goes to infinity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brams, S., Taylor, A.: Fair Division: from cake cutting to dispute resolution. Cambridge University Press, Cambridge (1996)

    Book  MATH  Google Scholar 

  2. Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: On low-envy truthful allocations. In: ADT, pp. 111–119 (2009)

    Google Scholar 

  3. Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice and cake cutting (2010), working paper (to appear in AAAI 2010)

    Google Scholar 

  4. Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. The American Mathematical Monthly 68, 1–17 (1961)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fisher, R.: Quelques remarques sur l’estimation en statistique. Byotypologie 6, 153–159 (1938)

    Google Scholar 

  6. Foley, D.: Resource allocation and the public sector. Yale Economics Essays 7, 45–98 (1967)

    Google Scholar 

  7. Knaster, B.: Sur le problème du partage pragmatique de h. steinhaus. Ann. Soc. Polonaise Math. 19, 228–231 (1944)

    Google Scholar 

  8. Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: EC 2004: Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 125–131. ACM, New York (2004)

    Google Scholar 

  9. Lyapunov, A.: Sur les fonctions-vecteurs complétement additives. Bulletin of the Academy of Sciences of the USSR 4, 465–478 (1940)

    MATH  Google Scholar 

  10. Neyman, J.: Un théorèm d’existence. C.R. Acad. Sci. Paris 222, 843–845 (1946)

    MathSciNet  MATH  Google Scholar 

  11. Rudin, W.: Real and Complex Analysis. McGraw-Hill, New York (1987)

    MATH  Google Scholar 

  12. Steinhaus, H.: The problem of fair division. Econometrica 16, 101–104 (1948)

    Google Scholar 

  13. Steinhaus, H.: Sur la division pragmatique. Econometrica 17(Suppl.), 315–319 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  14. Varian, H.: Equity, envy and efficiency. Journal of Economic Theory 9, 63–91 (1974)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. U.C. Berkeley, Greece

    Elchanan Mossel

  2. Weizmann Institute, Israel

    Elchanan Mossel & Omer Tamuz

Authors
  1. Elchanan Mossel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Omer Tamuz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lecturer, Department of Computer Science, University of Ioannina, Dourouti University Campus, 45110, Ioannina, Greece

    Spyros Kontogiannis

  2. Department of Informatics and Telecommunications Panepistimiopolis, Ilissia, Professor, National and Kapodistrian University of Athens, 15784, Athens, Greece

    Elias Koutsoupias

  3. Computer Engineering and Informatics Department (CEID), University of Patras, 26500, Patras, Greece

    Paul G. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mossel, E., Tamuz, O. (2010). Truthful Fair Division. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds) Algorithmic Game Theory. SAGT 2010. Lecture Notes in Computer Science, vol 6386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16170-4_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16170-4_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16169-8

  • Online ISBN: 978-3-642-16170-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation