Negative prices in network pricing games

DOI10.1016/j.orl.2022.01.001OpenAlexW4206355971MaRDI QIDQ2670481

Marc Schröder, Andrés Cristi

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.08884

zbMATH Keywords

Stackelberg gamesroad tollingbundlingnegative prices

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (2)

Stackelberg packing games ⋮ Stackelberg Max Closure with Multiple Followers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Stackelberg minimum spanning tree game
• Network topology and the efficiency of equilibrium
• Parallel recognition of series-parallel graphs
• Approximate revenue maximization with multiple items
• Toll caps in privatized road networks
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A Stackelberg knapsack game with weight control
• Stackelberg network pricing games
• An overview of Stackelberg pricing in networks
• On the severity of Braess's paradox: designing networks for selfish users is hard
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• Stackelberg network pricing is hard to approximate
• Excluding Braess’s Paradox in Nonatomic Selfish Routing
• Pricing network edges for heterogeneous selfish users
• On the Complexity of Stackelberg Matroid Pricing Problems
• On revenue maximization for selling multiple independently distributed items
• An approximation algorithm for Stackelberg network pricing
• Matroids Are Immune to Braess’ Paradox
• Über ein Paradoxon aus der Verkehrsplanung
• Stackelberg packing games

This page was built for publication: Negative prices in network pricing games