Combination can be hard

DOI10.1145/1109557.1109577MaRDI QIDQ3581529zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Mohammad Salavatipour, Mohammad T. Hajiaghayi, Uriel Feige

Publication date 16 August 2010

Published in Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1109557.1109577

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(12)

• Pricing loss leaders can be hard
• The Budgeted Unique Coverage Problem and Color-Coding
• On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer
• Optimal pricing of capacitated networks
• The Parameterized Complexity of the Unique Coverage Problem
• Envy-free pricing in multi-item markets
• On the hardness of pricing loss-leaders
• Pricing commodities
• On the complexity of the highway problem
• Price strategy implementation
• Optimal bundle pricing with monotonicity constraint
• Reducing mechanism design to algorithm design via machine learning

This page was built for publication: Combination can be hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581529)