Efficient cost-sharing mechanisms for prize-collecting problems
نویسندگان
چکیده
منابع مشابه
Efficient cost-sharing mechanisms for prize-collecting problems
Weconsider the problemof designing efficientmechanisms to share the cost of providing some service to a set of self-interested customers. In this paper, wemainly focus on cost functions that are induced by prize-collecting optimization problems. Such cost functions arise naturally whenever customers can be served in two different ways: either bybeingpart of a common service solution or bybeing ...
متن کاملApproximately Efficient Cost-Sharing Mechanisms
We study cost-sharing mechanisms for several fundamental NP-hard combinatorial optimization problems. A cost-sharing mechanism is a protocol that, given bids for a service, determines which bidders to serve and what prices to charge. The mechanism incurs a subset-dependent cost that is implicitly defined by an instance of a combinatorial optimization problem. Three desirable but mutually incomp...
متن کاملOn Euclidean Prize-collecting Steiner Forest Problems
In this paper, we consider prize-collecting Steiner forest and k-Steiner forest when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we simplify the analysis of the polynomial-time approximation scheme (PTAS) of Borradaile et al. [7, 8] for the Euclidean Steiner forest problem. This is done by proving a new structural property an...
متن کاملPrize-collecting Arc Routing Problems and Extensions
In this work we present the Prize-collecting Arc Routing Problem and some extensions. We derive properties that allow determining linear defining systems for the problems and solution approaches based on upper bounds obtained from relaxations reinforced with cuts, and lower bounds derived from heuristics. We also present numerical results from computational experiments that show that in many ca...
متن کاملPrize-Collecting Traveling Salesman and Related Problems
The most general version of the Prize Collecting Traveling Salesman Problem (PCTSP) was first introduced by Balas [8]. In this problem, a salesman has to collect a certain amount of prizes (the quota) by visiting cities. A known prize can be collected in every city. Furthermore, by not visiting a city, the salesman incurs a pecuniary penalty. The goal is to minimize the total travel distance pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2014
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-014-0781-1