Highly Influential

# Stackelberg Network Pricing Games

@article{Briest2007StackelbergNP, title={Stackelberg Network Pricing Games}, author={Patrick Briest and Martin Hoefer and Piotr Krysta}, journal={Algorithmica}, year={2007}, volume={62}, pages={733-753} }

- Published 2007 in Algorithmica
DOI:10.1007/s00453-010-9480-3

We study a multi-player one-round 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 polynomial-time solvable combinatorial minimization problem and choose a minimum cost solution satisfying their requirements based on the fixed costs and the leader’s prices. The leader receives as revenue the total amount of prices paid by… CONTINUE READING