1. Amanatidis, G., Birmpas, G., Markakis, E.: On truthful mechanisms for maximin share allocations. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016, pp. 31–37. IJCAI/AAAI Press (2016). URL http://www.ijcai.org/Abstract/16/012
2. Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms 13(4), 52:1-52:28 (2017). https://doi.org/10.1145/3147173
3. Amanatidis, G., Birmpas, G., Markakis, V.: Comparing approximate relaxations of envy-freeness. In: Lang, J., (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, July 13-19, 2018, pp. 42–48. Stockholm, Sweden (2018). https://doi.org/10.24963/ijcai.2018/6
4. Anshelevich, E.: Ordinal approximation in matching and social choice. SIGecom Exch. 15(1), 60–64 (2016). https://doi.org/10.1145/2994501.2994504
5. Anshelevich, E., Sekar, S.: Blind, greedy, and random: Algorithms for matching and clustering using only ordinal information. In: Schuurmans, D., Wellman, M.P. (eds.) Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, February 12-17, 2016, pp. 390–396. AAAI Press, Phoenix, Arizona, USA (2016). URL http://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/12099