Results 1  10
of
142
Improved hardness of approximation for Stackelberg shortestpath pricing
, 2009
"... We consider the Stackelberg shortestpath pricing problem, which is defined as follows. Given a graph G with fixedcost 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 cheapes ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
cheapest stpath in G and we receive payment equal to the sum of prices of pricable edges belonging to the path. Our goal is to find prices maximizing the payment received from the customer. While Stackelberg shortestpath pricing was known to be APXhard before, we provide the first explicit
Stackelberg Pricing is Hard to Approximate within 2 − epsilon
, 2009
"... Stackelberg Pricing Games is a twolevel combinatorial pricing problem studied in the Economics, Operation Research, and Computer Science communities. In this paper, we consider the decadeold shortest path version of this problem which is the first and most studied problem in this family. The game ..."
Abstract
 Add to MetaCart
Stackelberg Pricing Games is a twolevel combinatorial pricing problem studied in the Economics, Operation Research, and Computer Science communities. In this paper, we consider the decadeold shortest path version of this problem which is the first and most studied problem in this family. The game
Stackelberg Network Pricing is Hard to Approximate
, 812
"... 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 stpath once the tariffs are fixed. Roch, Savard, and ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
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 stpath once the tariffs are fixed. Roch, Savard
Stackelberg Network Pricing Games
, 2008
"... We study a multiplayer oneround game termed Stackelberg Network Pricing Game, in which a leader can set prices for a subset of m priceable edges in a graph. The other edges have a fixed cost. Based on the leader’s decision one or more followers optimize a polynomialtime solvable combinatorial min ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
. Our model extends several known pricing problems, including singleminded and unitdemand pricing, as well as Stackelberg pricing for certain follower problems like shortest path or minimum spanning tree. Our first main result is a tight analysis of a singleprice algorithm for the single follower
An overview of Stackelberg pricing in networks
 European Journal of Operational Research
"... The Stackelberg pricing problem has two levels of decision making: tariff setting by an operator, and then selection of the cheapest alternative by customers. In the network version, an operator determines tariffs on a subset of the arcs that he owns. Customers, who wish to connect two vertices with ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
, and the lower level problem is a shortest path problem for each of the customers. This manuscript contains a compilation of theoretical and algorithmic results on the Stackelberg pricing problem. The description of the theory and algorithms is generally informal and intuitive. We redefine the underlying network
The Stackelberg Minimum Spanning Tree Game
 In Proc. of 10th WADS
, 2007
"... Abstract. We consider a oneround twoplayer network pricing game, the Stackelberg Minimum Spanning Tree game or StackMST. The game is played on a graph (representing a network), whose edges are colored either red or blue, and where the red edges have a given fixed cost (representing the competitor’ ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
is the minimum spanning tree analog of the wellstudied Stackelberg shortestpath game. We analyze the complexity and approximability of the first player’s best strategy in StackMST. In particular, we prove that the problem is APXhard even if there are only two different red costs, and give an approximation
On the Stackelberg fuel pricing problem
"... We consider the Stackelberg fuel pricing problem in which a company has to decide the fuel selling price at each of its gas stations in order to maximize its revenue, assuming that the selling prices of the competitors and the customers ’ preferences are known in advance. We show that, even in the ..."
Abstract
 Add to MetaCart
is constant, while, in the general case, we show that the singleprice algorithm (which provides the bestknown solutions for essentially all the Stackelberg pricing problems studied in the literature up to date) achieves an approximation ratio which is logarithmic in some parameters of the input instance
Approximate Euclidean Shortest Paths In 3Space
, 1994
"... Papadimitriou's approximation approach to the Euclidean shortest path (ESP) in 3space is revisited. As this problem is NPhard, his approach represents an important step towards practical algorithms. However, there are several gaps in the original description. Besides giving a complete treat ..."
Abstract

Cited by 39 (4 self)
 Add to MetaCart
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) in 3space is revisited. As this problem is NPhard, his approach represents an important step towards practical algorithms. However, there are several gaps in the original description. Besides giving a complete
Shortest Paths with Bundles and Nonadditive Weights Is Hard
"... Abstract. In a standard path auction, all of the edges in a graph are sold as separate entities, each edge having a single cost. We consider a generalisation in which a graph is partitioned and each subset of edges has a unique owner. We show that if the owner is allowed to apply a nonadditive pric ..."
Abstract
 Add to MetaCart
additive pricing structure then the winner determination problem becomes NPhard (in contrast with the quadratic time algorithm for the standard additive pricing model). We show that this holds even if the owners have subsets of only 2 edges. For subadditive pricing (e.g. volume discounts), there is a trivial
Improved FPTAS for Multiobjective Shortest Paths with Applications
 COMPUTER TECHNOLOGY INSTITUTE. AND DELISTR0238 (DELIS PROJECT
, 2005
"... We consider multiobjective shortest paths, a fundamental (NPhard) problem in multiobjective optimization, where we are interested not in optimizing a single objective, but in finding a set of paths that captures the tradeoff (the socalled Pareto curve) among several objectives in a digraph whose ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
edges are associated with multidimensional cost vectors. We provide a new FPTAS for computing an approximate Pareto curve for multiobjective shortest paths that significantly improves upon previous approaches, especially in the case of more than two objective functions. We show how our new FPTAS can
Results 1  10
of
142