An approximation algorithm for Stackelberg network pricing
نویسندگان
چکیده
منابع مشابه
An approximation algorithm for Stackelberg network pricing
We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible shortest paths. We first prove that this problem is strongly NP-hard. We then provide a polynomial time algorithm with a worst-case precision guarantee of 12 log2 mT +1, where mT denotes the number of toll arcs. Finally ...
متن کاملDesign and analysis of an approximation algorithm for Stackelberg network pricing
We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible shortest paths. We first prove that this problem is strongly NP-hard. We then provide a polynomial time algorithm with a worst-case precision guarantee of 12 log mT +1, where mT denotes the number of toll arcs. Finally w...
متن کاملImproved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to the pricable edges. Based on the predefined fixed costs and our prices, a customer purchases a cheapest s-t-path in G and we receive payment equal to the sum of prices of pricable edges belonging to ...
متن کاملHardness of an Asymmetric 2-player Stackelberg Network Pricing Game
Consider a communication network represented by a directed graph G = (V, E) of n nodes and m edges. Assume that edges in E are partitioned into two sets: a set C of edges with a fixed non-negative real cost, and a set P of edges whose price should instead be set by a leader. This is done with the final intent of maximizing the payment she will receive for their use by a follower, whose goal is ...
متن کاملStackelberg network pricing is hard to approximate
In the Stackelberg network pricing problem, one has to assign tariffs to a certain subset of the arcs of a given transportation network. The aim is to maximize the amount paid by the user of the network, knowing that the user will take a shortest st-path once the tariffs are fixed. Roch, Savard, and Marcotte (Networks, Vol. 46(1), 57–67, 2005) proved that this problem is NP-hard, and gave an O(...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2005
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20074