Leximin Allocations in the Real World在现实世界中的分配.pdfVIP

Leximin Allocations in the Real World DAVID KUROKAWA, Carnegie Mellon University, USA ARIEL D. PROCACCIA, Carnegie Mellon University, USA NISARG SHAH, Carnegie Mellon University, USA As part of a collaboration with a major California school district, we study the problem of fairly allocating unused classrooms in public schools to charter schools. Our approach revolves around the randomized lex- imin mechanism. We extend previous work to the classroom allocation setting, showing that the leximin mechanism is proportional, envy-free, efficient, and group strategyproof. We also prove that the leximin mechanism provides a (worst-case) -approximation to the maximum number of classrooms that can possi- bly be allocated. Our experiments, which are based on real data, show that a nontrivial implementation of the leximin mechanism scales gracefully in terms of running time (even though the problem is intractable in theory), and performs extremely well with respect to a number of efficiency objectives. We take great pains to establish the practicability of our approach, and discuss issues related to its deployment. Categories and Subject Descriptors: I.2.0 [Computing Methodologies]: Artificial Intelligence—General; J.4 [Computer Applications]: Social and Behavioral Sciences—Economics General Terms: Algorithms, Economics Additional Key Words and Phrases: Fair division, Random assignment, Leximin 1. INTRODUCTION Over the course of the last seven decades, the study of fair division has given rise to a slew of elegant solutions to a variety of problems [Brams and Taylor 1996; Robertson and Webb 1998; Moulin 2003], which span the practicability spectrum from abstract ˘ (e.g., cake cutting [Procaccia 2013]) to everyday (e.g., rent division [Abdulkadiroglu et al. 2004]). Building on its rich history, the fiel