Approximation algorithms for the max-buying problem with limited supply

DOI10.1007/978-3-642-54423-1_61MaRDI QIDQ5405085zbMATH OpenOpenAlexFDO

Authors Cristina G. Fernandes, Rafael C. S. Schouery

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54423-1_61

zbMATH Keywords

approximation algorithmspricing problemunit-demand auctions

Mathematics Subject Classification ID

Randomized algorithms (68W20) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Consumer behavior, demand theory (91B42) Microeconomic theory (price theory and economic markets) (91B24)

Recommendations

• Approximation algorithms for the max-buying problem with limited supply
• Buying cheap is expensive: approximability of combinatorial pricing problems
• Improved hardness results for profit maximization pricing problems with unlimited supply
• Approximation algorithms and online mechanisms for item pricing
• Buying cheap is expensive: hardness of non-parametric multi-product pricing

Cited in

(2)

• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Approximation algorithms for the max-buying problem with limited supply

This page was built for publication: Approximation algorithms for the max-buying problem with limited supply

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