1. Abebe, R., Kleinberg, J., & Parkes, D. C. (2017). Fair division via social comparison. In Proceedings of AAMAS’17 (pp. 281–289).
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. Aziz, H., Rauchecker, G., Schryen, G., & Walsh, T. (2017). Algorithms for max-min share fair allocation of indivisible chores. In S. P. Singh & S. Markovitch (Eds.), Proceedings of the 31st AAAI conference on artificial intelligence (AAAI-17) (pp. 335–341). San Francisco, CA: AAAI Press.
4. Bei, X., Qiao, Y., & Zhang, S. (2017) Networked fairness in cake cutting. In Proceedings of the 26th international joint conference on artificial intelligence (IJCAI-17) (pp. 3632–3638).
5. Berman, P., Karpinski, M., & Scott, A. D. (2003). Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity Report, number 49.