An approximation algorithm for Stackelberg network pricing

DOI10.1002/net.20074zbMath1072.90004OpenAlexW2951951756MaRDI QIDQ5318277

Sebastien Roch, Gilles Savard, Patrice Marcotte

Publication date: 22 September 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20074

zbMATH Keywords

combinatorial optimizationapproximation algorithmsNP-hard problemsStackelberg gamesnetwork pricing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43) Deterministic network models in operations research (90B10)

Related Items (30)

Stackelberg bipartite vertex cover and the preflow algorithm ⋮ On the Complexity of Stackelberg Matroid Pricing Problems ⋮ A Catalog of Formulations for the Network Pricing Problem ⋮ Logit network pricing ⋮ Negative prices in network pricing games ⋮ Computational comparisons of different formulations for the Stackelberg minimum spanning tree game ⋮ A survey on mixed-integer programming techniques in bilevel optimization ⋮ The Stackelberg minimum spanning tree game ⋮ Bilevel Programming: The Montreal School ⋮ Stackelberg network pricing games ⋮ The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs ⋮ An exact algorithm for the network pricing problem ⋮ Specializations and generalizations of the Stackelberg minimum spanning tree game ⋮ New formulations and valid inequalities for a bilevel pricing problem ⋮ Valid inequalities and branch-and-cut for the clique pricing problem ⋮ A Bilevel Programming Model for a Cohesive Decision-Making on Strategic Pricing and Production Distribution Planning for a Small-Scale Supplier ⋮ On stackelberg pricing with computationally bounded customers ⋮ A tabu search algorithm for the network pricing problem ⋮ An overview of Stackelberg pricing in networks ⋮ Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting ⋮ Pricing bridges to cross a river ⋮ A smoothing heuristic for a bilevel pricing problem ⋮ A polyhedral study of the network pricing problem with connected toll arcs ⋮ Bilevel programming and price setting problems ⋮ Bilevel programming and price setting problems ⋮ A hybrid approach to the solution of a pricing model with continuous demand segmentation ⋮ Stackelberg network pricing is hard to approximate ⋮ Stackelberg packing games ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography ⋮ Stackelberg Max Closure with Multiple Followers

Cites Work

• Stackelberg scheduling strategies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for Stackelberg network pricing