PRICING GEOMETRIC TRANSPORTATION NETWORKS

DOI10.1142/S021819590900309XzbMath1181.90033OpenAlexW2124652308MaRDI QIDQ3405968

Martine Labbé, Stefan Langerman, Jean Cardinal, Belén Palop

Publication date: 12 February 2010

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819590900309x

zbMATH Keywords

optimizationStackelberg games

Mathematics Subject Classification ID

Noncooperative games (91A10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (5)

Stackelberg bipartite vertex cover and the preflow algorithm ⋮ Locating a single facility and a high-speed line ⋮ Weber problems with high-speed lines ⋮ Robust solutions to Stackelberg games: addressing bounded rationality and limited observations in human cognition ⋮ The Stackelberg minimum spanning tree game

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Voronoi diagram for services neighboring a highway
• Quickest paths, straight skeletons, and the city Voronoi diagram
• Equilibrium, games, and pricing in transportation and telecommunication networks
• A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem
• A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network

This page was built for publication: PRICING GEOMETRIC TRANSPORTATION NETWORKS