On the continuous quadratic knapsack problem
Mathematical Programming: Series A and B
To buy or not to buy: mining airfare data to minimize ticket purchase price
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Botticelli: A Supply Chain Management Agent
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Price prediction and insurance for online auctions
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Adaptive strategies for predicting bidding prices in supply chain management
Proceedings of the 10th international conference on Electronic commerce
CMieux: Adaptive strategies for competitive supply chain trading
Electronic Commerce Research and Applications
Flexible decision control in an autonomous trading agent
Electronic Commerce Research and Applications
The 2007 procurement challenge: A competition to evaluate mixed procurement strategies
Electronic Commerce Research and Applications
Learning approaches for developing successful seller strategies in dynamic supply chain management
Information Sciences: an International Journal
Real-Time Tactical and Strategic Sales Management for Intelligent Agents Guided by Economic Regimes
Information Systems Research
Hi-index | 0.00 |
In this paper, we examine the problem of choosing discriminatory prices for customers with probabilistic valuations and a seller with indistinguishable copies of a good. We show that under certain assumptions this problem can be reduced to the continuous knapsack problem (CKP). We present a new fast ε-optimal algorithm for solving CKP instances with asymmetric concave reward functions. We also show that our algorithm can be extended beyond the CKP setting to handle pricing problems with overlapping goods (e.g.goods with common components or common resource requirements), rather than indistinguishable goods.We provide a framework for learning distributions over customer valuations from historical data that are accurate and compatible with our CKP algorithm, and we validate our techniques with experiments on pricing instances derived from the Trading Agent Competition in Supply Chain Management (TAC SCM). Our results confirm that our algorithm converges to an ε-optimal solution more quickly in practice than an adaptation of a previously proposed greedy heuristic.