Algorithmic pricing for the partial assignment

DOI10.1007/978-3-030-36412-0_17MaRDI QIDQ2180150zbMATH OpenOpenAlexFDO

Authors Guichen Gao, Li Ning, Hing-Fung Ting, Yong Zhang, Yifei Zou

Publication date 13 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-36412-0_17

zbMATH Keywords

NP-hardnesspartial bundle sellingsocial welfare maximization

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Welfare economics (91B15) Microeconomic theory (price theory and economic markets) (91B24) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• Approximation algorithms for the partial assignment problem
• Approximation algorithms and online mechanisms for item pricing
• Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
• Optimal item pricing in online combinatorial auctions
• Approximation algorithms for the selling with preference

Cited in

(1)

• Social welfare and profit maximization from revealed preferences

This page was built for publication: Algorithmic pricing for the partial assignment

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