Abstract
We study partitions of a “cake” C among n players. Each player uses a countably additive non-atomic probability measure to evaluate the sizes of pieces of cake. If the players' measures are m1,m2,…,mn, then the “Individual Pieces Set,” which we studied before (2000, J. Math. Econom.33, 401–424), is the set {(m1(P1),m2(P2),…,mn(Pn)):〈P1,P2,…,Pn〉 is a partition of C}. We continue our study of this set here. Our motivating question is: What are the possible shapes of such sets? We give an exact characterization for n=2, establish some partial results for n=3, and close with open questions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
