1. Rediet Abebe, Jon Kleinberg, David C. Parkes, Fair division via social comparison, in: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS, 2017, pp. 281–289.
2. Eshwar Ram Arunachaleswaran, Siddharth Barman, Rachitesh Kumar, Nidhi Rathi, Fair and efficient cake division with connected pieces, in: Proceedings of the 15th Conference on Web and Internet Economics, WINE, 2019, pp. 57–70, Extended version available at CoRR abs/1907.11019v4.
3. The efficiency of fair division with connected pieces;Aumann;ACM Trans. Econ. Comput.,2015
4. Haris Aziz, Simon Mackenzie, A discrete and bounded envy-free cake cutting protocol for any number of agents, in: Proceedings of the 57th Annual Symposium on Foundations of Computer Science, FOCS, 2016, pp. 416–427.
5. Siddharth Barman, Pooja Kulkarni, Approximation algorithms for envy-free cake division with connected pieces, in: Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, ICALP, 2023, pp. 16:1–16:19.