Stackelberg Network Pricing Games
From MaRDI portal
Publication:4910714
DOI10.4230/LIPIcs.STACS.2008.1340zbMath1259.68234OpenAlexW2243826197MaRDI QIDQ4910714
Martin Hoefer, Patrick Briest, Piotr Krysta
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_97a9.html
Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Approximation algorithms (68W25) Combinatorial games (91A46) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (6)
Efficient heuristic algorithms for maximum utility product pricing problems ⋮ The Stackelberg minimum spanning tree game ⋮ Stackelberg network pricing games ⋮ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ On stackelberg pricing with computationally bounded customers ⋮ Stackelberg network pricing is hard to approximate
This page was built for publication: Stackelberg Network Pricing Games