Online Cake Cutting (published version)

Details Online Cake Cutting (published version) Online Cake Cutting (published version)

2011-06-27

arxiv.org/abs/1106.5316v1

Computer Science

Artificial Intelligence

To appear in the Proceedings of the Second International Conference on Algorithmic Decision Theory (ADT 2011)

Scientific paper

We propose an online form of the cake cutting problem. This models situations where agents arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the Dubins-Spanier moving knife procedure can be adapted to apply to such online problems. We propose some fairness properties that online cake cutting procedures can possess like online forms of proportionality and envy-freeness. We also consider the impact of collusion between agents. Finally, we study theoretically and empirically the competitive ratio of these online cake cutting procedures. Based on its resistance to collusion, and its good performance in practice, our results favour the online version of the cut-and-choose procedure over the online version of the moving knife procedure.

Affiliated with

Also associated with

No associations

Rating

Online Cake Cutting (published version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Cake Cutting (published version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Cake Cutting (published version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-638104