10 citations · 11 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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…
cs.DS2008
Stackelberg Network Pricing Games
Patrick Briest, Martin Hoefer, Piotr Krysta
We study a multi-player one-round game termed Stackelberg Network Pricing Game, in which a leader can set prices for a subset of priceable edges in a graph. The other edges hav…