Pricing commodities

DOI10.1016/j.tcs.2009.10.002zbMath1237.91117OpenAlexW2914860914MaRDI QIDQ627117

Aranyak Mehta, Robert Krauthgamer, Atri Rudra

Publication date: 21 February 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.10.002

zbMATH Keywords

approximation algorithmspricingrevenue maximizationLP roundingcombinatorial biddingsingle-minded biddersunit-demand bidders

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25)

Related Items

Improved approximation algorithms for the spanning star forest problem ⋮ Online pricing for bundles of multiple items

Cites Work

• Competitive auctions
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Combination can be hard
• Single-minded unlimited supply pricing on sparse instances
• New $\frac{3}{4}$-Approximation Algorithms for the Maximum Satisfiability Problem
• Automata, Languages and Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item