references.md

References

In construction

• Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi (2019). "Fair and Efficient Cake Division with Connected Pieces". Proceedings of WINE 2019, 57--70. Algorithm 1.

  • Programmer: Uri Zitser

• Yiling Chen, John K. Lai, David C. Parkes, Ariel D. Procaccia (2013): "Truth, justice, and cake cutting". Games and Economic Behavior. 77 (1): 284–297. Mechanism 1 (in section 3), and the algorithm described in section 4.

  • Programmer: Ofek Israel

Future work

For one programmer

• Jeff Edmonds, Kirk Pruhs (2006). "Balanced allocations of cake" Proceedings of FOCS 2006, 623--634.

• Xiaotie Deng, Qi Qi, Amin Saberi (2012). "Algorithmic solutions for envy-free cake cutting". Operations Research 60(6), 1461--1476. Algorithm 1.

• Yuga J Cohler, John K Lai, and David C Parkes, Ariel D Procaccia (2011). "Optimal envy-free cake cutting". Proceedings of AAAI 2011. (alternative link). Algorithms 1 and 2.

• David Kurokawa, John K. Lai, Ariel D Procaccia (2013). "How to Cut a Cake Before the Party Ends". Proceedings of AAAI 2013. (alternative link). Algorithms 1 and 2.

• Richard Cole, Vasilis Gkatzelis, Gagan Goel (2013): "Mechanism Design for Fair Division: Allocating Divisible Items Without Payments". Proceedings of EC 2013. 251–-268. Algorithms 1 and 3.

• Yonatan Aumann, Yair Dombb, Avinatan Hassidim (2012). "Computing socially-efficient cake divisions". Proceedings of AAMAS 2013, 343--350. Algorithms 1 and 2.

• Agnes Cseh, Tamas Fleiner (2018): "The complexity of cake cutting with unequal shares" Proceedings of SAGT 2018, pages={19--30}. Sections 4 and 7.

• Paul W Goldberg, Alexandros Hollender, Warut Suksompong (2019). "Contiguous Cake Cutting: Hardness Results and Approximation Algorithms". Proceedings of AAAI 2020. Algorithms 1 and 2.

For two programmers

• Haris Aziz, Chun Ye (2013): "Cake cutting algorithms for piecewise constant and piecewise uniform valuations". Proceedings of WINE 2014. 1--14. All 5 algorithms.

• Yonatan Aumann, Yair Dombb, Avinatan Hassidim (2015). "Auctioning time: Truthful auctions of heterogeneous divisible goods" ACM Transactions on Economics and Computation, 4(1). All algorithms.

• Haris Aziz, Simon MacKenzie (2017). "A discrete and bounded envy-free cake cutting protocol for any number of agents". Proceedings of FOCS 2016. Algorithms 1 and 2 (up to page 10).

• Georgios Amanatidis, George Christodoulou, John Fearnley, Evangelos Markakis, Christos-Alexandros Psomas, Eftychia Vakaliou (2018). "An improved envy-free cake cutting protocol for four agents" Proceedings of SAGT 2018, 87--99. All algorithms.

Future future work

• Xiaohui Bei, Xiaoming Sun, Hao Wu, Jialin Zhang, and Zhijie Zhang, Wei Zi (2019). "Cake Cutting on Graphs: A Discrete and Bounded Proportional Protocol" Proceedings of SODA 2020. Uses algorithms 1 and 2 from Aziz and Mackenzie (2017).

• Rediet Abebe, Richard Cole, Vasilis Gkatzelis, Jason D. Hartline (2019). "A Truthful Cardinal Mechanism for One-Sided Matching". Uses Algorithm 1 from Cole et al (2013).