Skip to main content
SpringerLink
Log in

Mark-Choose-Cut Algorithms For Fair And Strongly Fair Division

  • Published:
Group Decision and Negotiation Aims and scope Submit manuscript

Abstract

This paper proposes a new criterion to evaluate algorithms for cake division, by the number of resulting pieces. Then, inspired by the idea of "cut-and-choose", we present "mark-choose-cut" algorithms for fair and strongly fair cake division problems. They are game-theoretic algorithms. The number of resulting pieces is bounded by 2 × 3n-2 + 1 and 4 × 3n-2 + 1, for fair and strongly fair division respectively.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Barbanel, J. B. (1995). “Game-theoretic algorithms for fair and strongly fair cake division with entitlements,” Colloquium Mathematicum 69, 59–73.

    Google Scholar 

  • Brams, S. J. and A. D. Taylor. (1995a). “An envy-free cake division protocol,” American Mathematical Monthly 102, 9–18.

    Google Scholar 

  • Brams, S. J. and A. D. Taylor. (1995b). “A note on envy-free cake division,” Journal of Combinatorial Theory, Series A 70, 170–173.

    Google Scholar 

  • Brams, S. J. and A. D. Taylor. (1996). Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press.

  • Brams, S. J., A. D. Taylor and W.S. Zwicker. (1997). “A moving-knife solution to the four-person envy-free cake division problem,” Proceedings of the American Mathematical Society 125, 547–554.

    Google Scholar 

  • Even S. and A. Paz. (1984). “A note on cake cutting,” Discrete Applied Mathematics 7, 285–296.

    Google Scholar 

  • Rockafellar R. T. (1970). Convex Analysis. Princeton University Press.

  • Woodall D. R. (1986). “A note on the cake division problem,” Journal of Combinatorial Theory, Series A 42, 300–301.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Economics, Kagawa University, cKagawa, 760-8523, Japan E-mail

    Harunor Shishido & Dao-Zhi Zeng

Authors
  1. Harunor Shishido
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dao-Zhi Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shishido, H., Zeng, DZ. Mark-Choose-Cut Algorithms For Fair And Strongly Fair Division. Group Decision and Negotiation 8, 125–137 (1999). https://doi.org/10.1023/A:1008620404353

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008620404353

Search

Navigation