Mechanism Design for Constrained Heterogeneous Facility Location

• Published in: Algorithmic Game Theory Vol. 11801; pp. 63 - 76
• Main Authors: Kyropoulou, Maria, Ventre, Carmine, Zhang, Xiaomeng
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2019; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Facility location; Incentive compatibility; Mechanism design without money
• ISBN: 3030304728; 9783030304720
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-30473-7_5

The facility location problem has emerged as the benchmark problem in the study of the trade-off between incentive compatibility without transfers and approximation guarantee, a research area also known as approximate mechanism design without money. One limitation of the vast literature on the subject is the assumption that agents and facilities have to be located on the same physical space. We here initiate the study of constrained heterogeneous facility location problems, wherein selfish agents can either like or dislike the facility and facilities can be located on a given feasible region of the Euclidean plane. In our study, agents are assumed to be located on a real segment, and their location together with their preferences towards the facilities can be part of their private type. Our main result is a characterization of the feasible regions for which the optimum is incentive-compatible in the settings wherein agents can only lie about their preferences or about their locations. The stark contrast between the two findings is that in the former case any feasible region can be coupled with incentive compatibility, whilst in the second, this is only possible for feasible regions where the optimum is constant.