1. Arrow, K. (1951). Social choice and individual values. New York: Wiley.
2. Aziz, H., & Mackenzie, S. (2016). A discrete and bounded envy-free cake cutting protocol for any number of agents. In Proceedings of the 57th Symposium on Foundations of Computer Science (FOCS) (pp. 416–427).
3. Aziz, H., & Ye, C. (2014). Cake cutting algorithms for piecewise constant and piecewise uniform valuations. In Proceedings of the 10th Conference on Web and Internet Economics (WINE) (pp. 1–14).
4. Aziz, H., Bogomolnaia, A., & Moulin, H. (2017). Fair mixing: the case of dichotomous preferences.
arXiv:1712.02542
.
5. Benade, G., Nath, S., Procaccia, A. D., & Shah, N. (2017). Preference elicitation for participatory budgeting. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI) (pp. 376–382).