CEID Seminar & Social Hour: "New Fairness Concepts for Allocating Indivisible Items", Ioannis Caragiannis, Professor, Department of Computer Science, Aarhus University, Δανία
Τίτλος: New Fairness Concepts for Allocating Indivisible Items
Ομιλητής (εξ αποστάσεως): Ioannis Caragiannis Professor, Department of Computer Science, Aarhus University, Δανία
Ημερομηνία-χώρος: Παρασκευή 8 Δεκεμβρίου, 3-5μμ, ΤΜΗΥΠ, αμφιθέατρο Γ.
Περίληψη: For the fundamental problem of fairly dividing a set of indivisible items among agents, envy-freeness up to any item (EFX) and maximin fairness (MMS) are arguably the most compelling fairness concepts proposed till now. Unfortunately, despite significant efforts over the past few years, whether EFX allocations always exist is still an enigmatic open problem, let alone their efficient computation. Furthermore, today we know that MMS allocations are not always guaranteed to exist. These facts weaken the usefulness of both EFX and MMS, albeit their appealing conceptual characteristics. We propose two alternative fairness conceptsβ€”called epistemic EFX (EEFX) and minimum EFX value fairness (MXS)---inspired by EFX and MMS. For both, we explore their relationships to well-studied fairness notions and, more importantly, prove that EEFX and MXS allocations always exist and can be computed efficiently for additive valuations. Our results justify that the new fairness concepts are excellent alternatives to EFX and MMS. The talk is based on joint work with Jugal Garg, Nidhi Rathi, Eklavya Sharma, and Giovanna Varricchio.
Σχετικά με τον ομιλητή: Ioannis Caragiannis (Computer Scientist and Engineer; Diploma, 1996; PhD, 2002, University of Patras, Greece) is a Professor at the Department of Computer Science of Aarhus University, Denmark (since August 2020), where he also serves as the Head of the research group on Computational Complexity and Game Theory (since June 2021). Prior to his current appointment, he was a faculty member at the Department of Computer Engineering and Informatics of the University of Patras (Lecturer, 2006-09; Assistant Professor, 2009-15; Associate Professor, 2015-20; Professor, 2020), where he served as the Director of the Division of Foundations of Computer Science and Applications (2017-20) and as the Deputy Director of the graduate program in "Data-Driven Computing and Decision Making" (2018-20). His research interests include design and analysis of algorithms (including approximation and online algorithms), economics and computation (computational aspects of fair division, voting, matching problems, auctions, and congestion games), and foundations of machine learning and artificial intelligence (including strategic aspects of learning tasks and data processing). He has published more than 180 papers in conference proceedings, scientific journals, and books. He was the recipient of the Artificial Intelligence 2022 Prominent Paper Award and also received a Distinguished Paper Honorable Mention at IJCAI 2019. His teaching experience includes undergraduate and graduate courses in algorithms and complexity in Patras and Aarhus. He is a member of the Association for Computing Machinery (ACM, SIGACT, SIGECOM), the Association for the Advancement of Artificial Intelligence (AAAI), and the European Association for Theoretical Computer Science (EATCS).
---------------------------------------------------------------------------------------------------------