Optimal Proportional Cake Cutting with Connected Pieces

@inproceedings{Bei2012OptimalPC,
  title={Optimal Proportional Cake Cutting with Connected Pieces},
  author={Xiaohui Bei and Ning Chen and Xia Hua and Biaoshuai Tao and Endong Yang},
  booktitle={AAAI},
  year={2012}
}
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social welfare) are the most critical criteria to satisfy and optimize, respectively. We study computational complexity of computing an efficiency optimal division given the conditions that the allocation satisfies proportional fairness and assigns each agent a connected piece. For linear valuation functions, we give a polynomial… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 31 CITATIONS

Computing Socially-Efficient Cake Divisions

VIEW 5 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

How to Cut a Cake Before the Party Ends

VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

References

Publications referenced by this paper.