Offline and online algorithms for single-minded selling problem

DOI10.1016/J.TCS.2020.03.017MaRDI QIDQ2173298zbMATH OpenOpenAlexFDO

Authors Yong Zhang, Francis Y. L. Chin, Sheung-Hung Poon, Hing-Fung Ting, Dongxiao Yu, Dachuan Xu

Publication date 22 April 2020

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

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

zbMATH Keywords

competitive ratioNP-hardnessapproximation ratiosingle-minded selling

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Approximation and competitive algorithms for single-minded selling problem
• Online pricing for bundles of multiple items
• Online pricing for multi-type of items
• Approximation algorithms and online mechanisms for item pricing
• On Hardness of Pricing Items for Single-Minded Bidders

Cites work

• Average-case competitive analyses for one-way trading
• Buying cheap is expensive: hardness of non-parametric multi-product pricing
• Competitive algorithms for unbounded one-way trading
• Constant competitive algorithms for unbounded one-way trading under monotone hazard rate
• Dynamic pricing for impatient bidders
• Improved hardness results for profit maximization pricing problems with unlimited supply
• Introduction to algorithms.
• On profit-maximizing envy-free pricing
• Online pricing for bundles of multiple items
• Optimal envy-free pricing with metric substitutability
• Optimal search and one-way trading online algorithms
• Reducibility among combinatorial problems

Cited in

(5)

• Time and energy driven online scheduling problem in EV charging
• Models and algorithms for the product pricing with single-minded customers requesting bundles
• Approximation algorithms for the partial assignment problem
• EFX under budget constraint
• Approximation and competitive algorithms for single-minded selling problem

This page was built for publication: Offline and online algorithms for single-minded selling problem

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