English
Related papers

Related papers: Truthful Two-Facility Location with Candidate Loca…

200 papers

The study of motility control by smart agents offers a promising platform for systematically exploring the fundamental physical constraints underlying the functioning of bio-inspired micro-machines operating far from equilibrium. Here, we…

Statistical Mechanics · Physics 2024-09-20 Luca Cocconi , Benoît Mahault , Lorenzo Piro

This paper studies the problem of minimizing group-level inequity in facility location games on the real line, where agents belong to different groups and may act strategically. We explore a fairness-oriented objective that minimizes the…

Computer Science and Game Theory · Computer Science 2026-02-03 Yuhang Guo , Houyu Zhou

To address efficiency and design challenges in choice-based matching platforms, we introduce a two-sided assortment optimization framework under general choice preferences. The goal in this problem is to maximize the expected number of…

Optimization and Control · Mathematics 2026-05-08 Omar El Housni , Ulysse Hennebelle , Alfredo Torrico

Strategic learning studies how decision rules interact with agents who may strategically change their inputs/features to achieve better outcomes. In standard settings, models assume that the decision-maker's sole scope is to learn a…

Computer Science and Game Theory · Computer Science 2025-10-23 Valia Efthymiou , Ekaterina Fedorova , Chara Podimata

Facility location games have been a topic of major interest in economics, operations research and computer science, starting from the seminal work by Hotelling. In the classical pure location Hotelling game businesses compete for maximizing…

Computer Science and Game Theory · Computer Science 2018-08-08 Omer Ben-Porat , Moshe Tennenholtz

In this paper, we introduce and study the Facility Location Problem with Aleatory Agents (FLPAA), where the facility accommodates n agents larger than the number of agents reporting their preferences, namely n_r. The spare capacity is used…

Computer Science and Game Theory · Computer Science 2024-09-30 Gennaro Auricchio , Jie Zhang

Understanding the dynamics of evolving social or infrastructure networks is a challenge in applied areas such as epidemiology, viral marketing, or urban planning. During the past decade, data has been collected on such networks but has yet…

Social and Information Networks · Computer Science 2014-03-27 David Eisenstat , Claire Mathieu , Nicolas Schabanel

We consider the "Offline Ad Slot Scheduling" problem, where advertisers must be scheduled to "sponsored search" slots during a given period of time. Advertisers specify a budget constraint, as well as a maximum cost per click, and may not…

Computer Science and Game Theory · Computer Science 2008-01-21 Jon Feldman , S. Muthukrishnan , Evdokia Nikolova , Martin Pal

In traditional facility location problems, a set of points is provided, and the objective is to determine the best location for a new facility based on criteria such as minimizing cost, time, and distances between clients and facilities.…

Optimization and Control · Mathematics 2025-03-11 Nazanin Tour-Savadkoohi , Jafar Fathali

Strategic product placement can have a strong influence on customer purchase behavior in physical stores as well as online platforms. Motivated by this, we consider the problem of optimizing the placement of substitutable products in…

Data Structures and Algorithms · Computer Science 2025-10-06 Omar El Housni , Rajan Udwani

We analyze the problem of locating a public facility on a line in a society where agents have either single-peaked or single-dipped preferences. We consider the domain analyzed in Alcalde-Unzu et al. (2024), where the type of preference of…

Theoretical Economics · Economics 2025-10-15 Oihane Gallo

Online double auctions (DAs) model a dynamic two-sided matching problem with private information and self-interest, and are relevant for dynamic resource and task allocation problems. We present a general method to design truthful DAs, such…

Computer Science and Game Theory · Computer Science 2012-07-09 Jonathan Bredin , David C. Parkes

We study fairness in house allocation, where $m$ houses are to be allocated among $n$ agents so that every agent receives one house. We show that maximizing the number of envy-free agents is hard to approximate to within a factor of…

Computer Science and Game Theory · Computer Science 2021-07-15 Naoyuki Kamiyama , Pasin Manurangsi , Warut Suksompong

We study the two-sided stable matching problem with one-sided uncertainty for two sets of agents A and B, with equal cardinality. Initially, the preference lists of the agents in A are given but the preferences of the agents in B are…

Data Structures and Algorithms · Computer Science 2024-07-16 Evripidis Bampis , Konstantinos Dogeas , Thomas Erlebach , Nicole Megow , Jens Schlöter , Amitabh Trehan

Upcoming WiFi-based localization systems for indoor environments face a conflict of privacy interests: Server-side localization violates location privacy of the users, while localization on the user's device forces the localization provider…

Cryptography and Security · Computer Science 2014-10-14 Jan Henrik Ziegeldorf , Nicolai Viol , Martin Henze , Klaus Wehrle

We initiate the study of matching roommates and rooms wherein the preferences of agents over other agents and rooms are complementary and represented by Leontief utilities. In this setting, 2n agents must be paired up and assigned to n…

Computer Science and Game Theory · Computer Science 2024-12-19 Hadi Hosseini , Shivika Narang , Sanjukta Roy

In this paper, we investigate the $k$-Facility Location Problem ($k$-FLP) within the Bayesian Mechanism Design framework, in which agents' preferences are samples of a probability distributed on a line. Our primary contribution is…

Computer Science and Game Theory · Computer Science 2024-07-10 Gennaro Auricchio , Jie Zhang

As mobile devices have been ubiquitous, participatory sensing emerges as a powerful tool to solve many contemporary real life problems. Here, we contemplate the participatory sensing in online double auction environment by considering the…

Computer Science and Game Theory · Computer Science 2017-06-27 Jaya Mukhopadhyay , Vikash Kumar Singh , Sajal Mukhopadhyay , Anita Pal

Strategy-proof mechanisms are widely used in market design. In an abstract allocation framework where outside options are available to agents, we obtain two results for strategy-proof mechanisms. They provide a unified foundation for…

Theoretical Economics · Economics 2021-01-05 Jun Zhang

We study the problem of design of strategyproof in expectation (SP) mechanisms for facility location on a cycle, with the objective of minimizing the sum of costs of $n$ agents. We show that there exists an SP mechanism that attains an…

Computer Science and Game Theory · Computer Science 2025-05-20 Krzysztof Rogowski , Marcin Dziubiński