[C15] Online Fair Division: A Survey. M. Aleksandrov and T. Walsh. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, February 7-12, 2020. AAAI Press, 2020, pp. 13557–13562 (BIB, URL).
[C14] Two Algorithms for Additive and Fair Division of Mixed Manna. M. Aleksandrov and T. Walsh. In: KI 2020: Advances in Artificial Intelligence - 43rd German Conference on AI, Bamberg, Germany, September 21-25, 2020, Proceedings. Ed. by U. Schmid, F. Klügl, and D. Wolter. Vol. 12325. Lecture Notes in Computer Science. Springer, 2020, pp. 3–17, Best Paper Award (BIB, URL).
[C13] Fair Division Minimizing Inequality. M. Aleksandrov, C. Ge, and T. Walsh. In: Progress in Artificial Intelligence, 19th EPIA Conference on Artificial Intelligence, EPIA 2019, Vila Real, Portugal, September 3-6, 2019, Proceedings, Part II. Ed. by P. M. Oliveira, P. Novais, and L. P. Reis. Vol. 11805. Lecture Notes in Computer Science. Springer, 2019, pp. 593–605 (BIB, URL).
[C12] Monotone and Online Fair Division. M. Aleksandrov and T. Walsh. In: KI 2019: Advances in Artificial Intelligence - 42nd German Conference on AI, Kassel, Germany, September 23-26, 2019, Proceedings. Ed. by C. Benzmüller and H. Stuckenschmidt. Vol. 11793. Lecture Notes in Computer Science. Springer, 2019, pp. 60–75, Best Paper Award (BIB, URL).
[C11] Strategy-Proofness, Envy-Freeness and Pareto Efficiency in Online Fair Division with Additive Utilities. M. Aleksandrov and T. Walsh. In: PRICAI 2019: Trends in Artificial Intelligence - 16th Pacific Rim International Conference on Artificial Intelligence, Cuvu, Yanuca Island, Fiji, August 26-30, 2019, Proceedings, Part I. Ed. by A. C. Nayak and A. Sharma. Vol. 11670. Lecture Notes in Computer Science. Springer, 2019, pp. 527–541 (BIB, URL).
[C10] Group Envy Freeness and Group Pareto Efficiency in Fair Division with Indivisible Items. M. Aleksandrov and T. Walsh. In: KI 2018: Advances in Artificial Intelligence - 41st German Conference on AI, Berlin, Germany, September 24-28, 2018, Proceedings. Ed. by F. Trollmann and A. Turhan. Vol. 11117. Lecture Notes in Computer Science. Springer, 2018, pp. 57–72 (BIB, URL).
[C9] Expected Outcomes and Manipulations in Online Fair Division. M. Aleksandrov and T. Walsh. In: KI 2017: Advances in Artificial Intelligence - 40th Annual German Conference on AI, Dortmund, Germany, September 25-29, 2017, Proceedings. Ed. by G. Kern-Isberner, J. Fürnkranz, and M. Thimm. Vol. 10505. Lecture Notes in Computer Science. Springer, 2017, pp. 29–43, Best Paper Award (BIB, URL).
[C8] Most Competitive Mechanisms in Online Fair Division. M. Aleksandrov and T. Walsh. In: KI 2017: Advances in Artificial Intelligence - 40th Annual German Conference on AI, Dortmund, Germany, September 25-29, 2017, Proceedings. Ed. by G. Kern-Isberner, J. Fürnkranz, and M. Thimm. Vol. 10505. Lecture Notes in Computer Science. Springer, 2017, pp. 44–57 (BIB, URL).
[C7] Pure Nash Equilibria in Online Fair Division. M. Aleksandrov and T. Walsh. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017. Ed. by C. Sierra. ijcai.org, 2017, pp. 42–48 (BIB, URL).
[P5] Pure Nash Equilibria in Online Fair Division. M. Aleksandrov and T. Walsh. Poster accepted at the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017. Ed. by C. Sierra. ijcai.org, 2017 (PDF, URL).