On Hardness of Pricing Items for Single-Minded Bidders

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

M. I. Sviridenko, Rohit Khandekar, Konstantin Makarychev, 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

68R10: Graph theory (including graph drawing) in computer science

91B24: Microeconomic theory (price theory and economic markets)

91B26: Auctions, bargaining, bidding and selling, and other market models

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)