1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.GT2009
Stackelberg Pricing is Hard to Approximate within
Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai
Stackelberg Pricing Games is a two-level combinatorial pricing problem studied in the Economics, Operation Research, and Computer Science communities. In this paper, we consider th…
cs.DS2009★ 1 cited
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
Patrick Briest, Sanjeev Khanna
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…