On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
From MaRDI portal
Publication:3648863
DOI10.1007/978-3-642-04645-2_25zbMath1262.90181arXiv0901.1140OpenAlexW3121718165MaRDI QIDQ3648863
Rajiv Raman, Saurabh Ray, R. A. Sitters, Khaled M. Elbassioni
Publication date: 1 December 2009
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.1140
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (9)
On revenue maximization with sharp multi-unit demands ⋮ An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph ⋮ On stackelberg pricing with computationally bounded customers ⋮ On the complexity of the highway problem ⋮ Unnamed Item ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ Online pricing for bundles of multiple items ⋮ Envy-free pricing in multi-item markets ⋮ Unnamed Item
This page was built for publication: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
