On the complexity of the highway pricing problem
Grigoriev, Alexander and Loon, Joyce van and Uetz, Marc (2010) On the complexity of the highway pricing problem. In: 36th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2010, 23-29 Jan, 2010, Špindleruv Mlýn, Czech Republic (pp. pp. 465-476).
Restricted to UT campus only : Request a copy
|Abstract:||The highway pricing problem asks for prices to be determined for segments of a single highway such as to maximize the revenue obtainable from a given set of customers with known valuations. The problem is NP-hard and a recent quasi-PTAS suggests that a PTAS might be in reach. Yet, so far it has resisted any attempt for constant-factor approximation algorithms. We relate the tractability of the problem to structural properties of customers' valuations. We show that the problem becomes NP-hard as soon as the average valuations of customers are not homogeneous, even under further restrictions such as monotonicity. Moreover, we derive an efficient approximation algorithm, parameterized along the inhomogeneity of customers' valuations. Finally, we discuss extensions of our results that go beyond the highway pricing problem.
|Item Type:||Conference or Workshop Item|
|Copyright:||© 2010 Springer|
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/69653|
|Export this item as:||BibTeX|
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page