On Hardness of Pricing Items for Single-Minded Bidders

DOI10.1007/978-3-642-03685-9_16zbMath1255.68075OpenAlexW1777669883MaRDI QIDQ3638879

Rohit Khandekar, Konstantin Makarychev, M. I. Sviridenko, Tracy Kimbrel

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_16

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Microeconomic theory (price theory and economic markets) (91B24) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Graph pricing with limited supply ⋮ Pricing loss leaders can be hard ⋮ On the approximability of digraph ordering ⋮ An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph ⋮ The envy-free pricing problem, unit-demand markets and connections with the network pricing problem ⋮ On the complexity of the highway problem ⋮ Models and algorithms for the product pricing with single-minded customers requesting bundles ⋮ Unnamed Item

This page was built for publication: On Hardness of Pricing Items for Single-Minded Bidders