Covering selfish machines
Leah Epstein, Rob van Stee
Abstract
We consider the machine covering problem for selfish related machines. For a constant number of machines, m, we show a monotone polynomial time approximation scheme (PTAS) with running time that is linear in the number of jobs. It uses a new technique for reducing the number of jobs while remaining close to the optimal solution. We also present an FPTAS for the classical machine covering problem (the previous best result was a PTAS) and use this to give a monotone FPTAS. Additionally, we give a monotone approximation algorithm with approximation ratio (m,(2+)s1/sm) where >0 can be chosen arbitrarily small and si is the (real) speed of machine i. Finally we give improved results for two machines. Our paper presents the first results for this problem in the context of selfish machines.
Create a lesson
Related papers
Constrained Fair Allocations via Partition Matroid Reductions
Benjamin Cookson, Nisarg Shah
Bidding Games with Rewards: Taming Infinite Configuration Space
Matan Pinkas
Reaching Fairness by Reallocating Goods
Robert Bredereck, Eva Deltl, Tanmay Inamdar et al.
Test-time Reinforcement Learning in Imperfect Information Games
Ondrej Kubicek, Viliam Lisy, Tuomas Sandholm
LangBP: Language-Guided Reasoning and Acting for Joint Bidding and Pricing
Jiaqi Ding, Chuan Yang, Linghui Meng et al.
Mechanism Design for Facility Location Games Under a Prelocated Facility
Genjie Qin, Qizhi Fang, Wenjing Liu