1. Arunachaleswaran, E.R., Barman, S., Kumar, R., & Rathi, N. (2019). Fair and efficient cake division with connected pieces. arXiv preprint arXiv:190711019.
2. Aumann, Y., & Dombb, Y. (2010). The efficiency of fair division with connected pieces. In International workshop on internet and network economics (pp. 26–37). Springer.
3. Aumann, Y., Dombb, Y., & Hassidim, A. (2013). Computing socially-efficient cake divisions. In Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems (pp. 343–350). International Foundation for Autonomous Agents and Multiagent Systems
4. Aziz, H., & Ye, C. (2014). Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In International conference on web and internet economics (pp. 1–14). Springer.
5. Aziz, H., Hassidim, A., & Segal-Halevi, E. (2020). Fair allocation with diminishing differences. Journal of Artificial Intelligence Research, 67, 471–507.