Ramsey partitions of integers and fair divisions

Abstract

Ifk1 andk2 are positive integers, the partitionP = (α12,...,αn) ofk1+k2 is said to be a Ramsey partition for the pairk1,k2 if for any sublistL ofP, either there is a sublist ofL which sums tok1 or a sublist ofPL which sums tok2. Properties of Ramsey partitions are discussed. In particular it is shown that there is a unique Ramsey partition fork1,k2 having the smallest numbern of terms, and in this casen is one more than the sum of the quotients in the Euclidean algorithm fork1 andk2.

An application of Ramsey partitions to the following fair division problem is also discussed: Suppose two persons are to divide a cake fairly in the ratiok1k2. This can be done trivially usingk1+k2-1 cuts. However, every Ramsey partition ofk1+k2 also yields a fair division algorithm. This method yields fewer cuts except whenk1=1 andk2=1, 2 or 4.

This is a preview of subscription content, access via your institution.

References

  1. [1]

    A. M. Fink: A Note on the Fair-Division Problem,Mathematics Magazine37 (1964), 341–342.

    MathSciNet  Article  Google Scholar 

  2. [2]

    J. Robertson andW. Webb: Minimal Number of Cuts for Fair Division,Ars Combinatoria31 (1991), 191–197.

    MathSciNet  MATH  Google Scholar 

  3. [3]

    H. Steinhaus: The Problem of Fair Division,Econometrica16 (1948), 101–104.

    Google Scholar 

  4. [4]

    D. R. Woodall: Dividing a Cake Fairly,J. of Math. Anal. and App.78 (1980), 233–247.

    MathSciNet  Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

McAvaney, K., Robertson, J. & Webb, W. Ramsey partitions of integers and fair divisions. Combinatorica 12, 193–201 (1992). https://doi.org/10.1007/BF01204722

Download citation

AMS subject classification code (1991)

  • 05 A 17
  • 05 D 10
  • 11 P 81