Pricing bridges to cross a river

DOI10.1002/nav.20216zbMath1210.91024OpenAlexW2096303084MaRDI QIDQ5436961

Frits C. R. Spieksma, Mustapha Bouhtou, Stan P. M. van Hoesel, Anton F. van der Kraaij, Marc Uetz, Alexander Grigoriev

Publication date: 18 January 2008

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/8a4e863e-c6c4-4098-aaa3-217e7ed15c57

zbMATH Keywords

complexityapproximationpricingtelecommunication networksStackelberg game

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Hierarchical games (including Stackelberg games) (91A65) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (12)

Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ Efficient heuristic algorithms for maximum utility product pricing problems ⋮ The Stackelberg minimum spanning tree game ⋮ Stackelberg network pricing games ⋮ On the complexity of a bundle pricing problem ⋮ A tabu search algorithm for the network pricing problem ⋮ Bilevel programming and price setting problems ⋮ Bilevel programming and price setting problems ⋮ Stackelberg network pricing is hard to approximate ⋮ Stackelberg packing games ⋮ On complexity of the bilevel location and pricing problems ⋮ An iterative two-stage heuristic algorithm for a bilevel service network design and pricing model

Cites Work

• Unnamed Item
• Unnamed Item
• How bad is selfish routing?
• Pricing network edges for heterogeneous selfish users
• An approximation algorithm for Stackelberg network pricing
• Automata, Languages and Programming
• Approximation and Online Algorithms

This page was built for publication: Pricing bridges to cross a river