English
Related papers

Related papers: Optimizing Multiple Simultaneous Objectives for Vo…

200 papers

We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios compared to the usual deterministic clustering setting.…

Data Structures and Algorithms · Computer Science 2023-10-13 David G. Harris , Shi Li , Thomas Pensyl , Aravind Srinivasan , Khoa Trinh

We study a constrained distributed heterogeneous two-facility location problem, where a set of agents with private locations on the real line are divided into disjoint groups. The constraint means that the facilities can only be built in a…

Computer Science and Game Theory · Computer Science 2025-08-12 Xinru Xu , Wenjing Liu , Qizhi Fang

We study two generalizations of classic clustering problems called dynamic ordered $k$-median and dynamic $k$-supplier, where the points that need clustering evolve over time, and we are allowed to move the cluster centers between…

Data Structures and Algorithms · Computer Science 2022-07-26 Shichuan Deng , Jian Li , Yuval Rabani

We consider k-Facility Location games, where n strategic agents report their locations on the real line, and a mechanism maps them to k facilities. Each agent seeks to minimize his connection cost, given by a nonnegative increasing function…

Computer Science and Game Theory · Computer Science 2013-05-16 Dimitris Fotakis , Christos Tzamos

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

In Euclidean Uniform Facility Location (UFL), the input is a set of clients in $\mathbb{R}^d$ and the goal is to place facilities to serve them, so as to minimize the total cost of opening facilities plus connecting the clients. We study…

Data Structures and Algorithms · Computer Science 2023-01-31 Artur Czumaj , Arnold Filtser , Shaofeng H. -C. Jiang , Robert Krauthgamer , Pavel Veselý , Mingwei Yang

With growing emphasis on e-commerce marketplace platforms where we have a central platform mediating between the seller and the buyer, it becomes important to keep a check on the availability and profitability of the central store. A store…

Data Structures and Algorithms · Computer Science 2021-06-28 Sapna Grover , Neelima Gupta , Rajni Dabas

We provide nearly optimal algorithms for online facility location (OFL) with predictions. In OFL, $n$ demand points arrive in order and the algorithm must irrevocably assign each demand point to an open facility upon its arrival. The…

Data Structures and Algorithms · Computer Science 2022-08-08 Shaofeng H. -C. Jiang , Erzhi Liu , You Lyu , Zhihao Gavin Tang , Yubo Zhang

We consider competitive facility location as a two-stage multi-agent system with two types of clients. For a given host graph with weighted clients on the vertices, first facility agents strategically select vertices for opening their…

Computer Science and Game Theory · Computer Science 2024-07-10 Simon Krogmann , Pascal Lenzner , Alexander Skopalik , Marc Uetz , Marnix C. Vos

We study the mechanism design problem of facility location on a metric space in the learning-augmented framework, where mechanisms have access to imperfect predictions of the optimal facility locations. Our objective is to design…

Computer Science and Game Theory · Computer Science 2026-05-05 Hau Chan , Jianan Lin , Chenhao Wang

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

In Hotelling's model of spatial competition, a unit mass of voters is distributed in the interval $[0,1]$ (with their location corresponding to their political persuasion), and each of $m$ candidates selects as a strategy his distinct…

Computer Science and Game Theory · Computer Science 2024-05-09 Umang Bhaskar , Soumyajit Pyne

We study the problem of locating a single facility on a real line based on the reports of self-interested agents, when agents have double-peaked preferences, with the peaks being on opposite sides of their locations. We observe that…

Computer Science and Game Theory · Computer Science 2015-02-20 Aris Filos-Ratsikas , Minming Li , Jie Zhang , Qiang Zhang

We study a non-cooperative two-sided facility location game in which facilities and clients behave strategically. This is in contrast to many other facility location games in which clients simply visit their closest facility. Facility…

Computer Science and Game Theory · Computer Science 2024-06-14 Simon Krogmann , Pascal Lenzner , Alexander Skopalik

We consider a single-facility location problem, where agents are positioned on the real line and are partitioned into multiple disjoint districts. The goal is to choose a location (where a public facility is to be built) so as to minimize…

Computer Science and Game Theory · Computer Science 2021-07-13 Aris Filos-Ratsikas , Alexandros A. Voudouris

Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…

Computational Geometry · Computer Science 2021-08-26 Vladimir Shenmaier

We consider a truthful facility location problem in which there is a set of agents with private locations on the line of real numbers, and the goal is to place a number of facilities at different locations chosen from the set of those…

Computer Science and Game Theory · Computer Science 2025-02-18 Argyrios Deligkas , Mohammad Lotfi , Alexandros A. Voudouris

Many systems require optimisation over multiple objectives, where objectives are characteristics of the system such as energy consumed or increase in time to perform the work. Optimisation is performed by selecting the `best' set of input…

Performance · Computer Science 2019-10-08 Alexander J. M. Kell , Matthew Forshaw , A. Stephen McGough

We consider the problem of locating a public facility on a line, where a set of $n$ strategic agents report their \emph{locations} and a mechanism determines, either deterministically or randomly, the location of the facility. Game…

Computer Science and Game Theory · Computer Science 2013-10-29 Michal Feldman , Yoav Wilf

The recent promotion of sustainable urban planning combined with a growing need for public interventions to improve well-being and health have led to an increased collective interest for green spaces in and around cities. In particular,…

Artificial Intelligence · Computer Science 2023-03-14 Caroline Leboeuf , Margarida Carvalho , Yan Kestens , Benoît Thierry