Pricing for customers with probabilistic valuations as a continuous knapsack problem

ACM International Conference Proceeding Series

Volumn , Issue , 2006, Pages 38-46

  Benisch, Michael ^a   Andrews, James ^a   Sadeh, Norman ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

Supply chain management; TAC SCM; Trading agents

Indexed keywords

COMMON RESOURCES; CUSTOMER VALUATION; GREEDY HEURISTICS; HISTORICAL DATA; KNAPSACK PROBLEMS; OPTIMAL ALGORITHM; OPTIMAL SOLUTIONS; PRICING PROBLEMS; PROBABILISTIC VALUATIONS; REWARD FUNCTION; TAC SCM; TRADING AGENT; TRADING AGENT COMPETITION;

COSTS; CUSTOMER SATISFACTION; ELECTRONIC COMMERCE; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; LEARNING ALGORITHMS; LOGISTICS; SALES; SUPPLY CHAINS;

SUPPLY CHAIN MANAGEMENT;

EID: 70450211671     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1151454.1151475     Document Type: Conference Paper

References (12)

1. M. Benisch, A. Greenwald, I. Grypari, R. Lederman, V. Naroditskiy, and M. C. Tschantz. Botticelli: A supply chain management agent. In Proceedings of AAMAS '04, pages 1174-1181, New York, July 2004.
2. K. E. Case and R. C. Fair. Principles of Economics (5th ed.). Prentice-Hall, 1999.
3. J. Collins, R. Arunachalam, N. Sadeh, J. Eriksson, N. Finne, and S. Janson. The supply chain management game for the 2005 trading agent competition. Technical Report CMU-ISRI-04-139, Carnegie Mellon University, 2005.
4. O. Etzioni, R. Tuchinda, C. A. Knoblock, and A. Yates. To buy or not to buy: mining airfare data to minimize ticket purchase price. In Proceedings of KDD'09, pages 119-128, New York, NY, USA, 2003. ACM Press.
5. R. Ghani. Price prediction and insurance for online auctions. In Proceedigns of KDD'05, pages 411-418, New York, NY, USA, 2005. ACM Press.
6. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, 2004.
7. D. Lawrence. A machine-learning approach to optimal bid pricing. In Proceedings of INFORMS'03 2003.
8. A. Melman and G. Rabinowitz. An efficient method for a class of continuous knapsack problems. Society for Industrial and Applied Mathematics Review, 42(3):440-448, 2000.
9. D. Pardoe and P. Stone. Bidding for customer orders in TAC SCM. In Proceedings of AAMAS-04 Workshop on Agent-Mediated Electronic Commerce, 2004.
10. J. R. Quinlan. Learning with Continuous Classes. In 5th Australian Joint Conference on Artificial Intelligence, pages 343-348, 1992.
11. A. G. Robinson, N. Jiang, and C. S. Lerme. On the continuous quadratic knapsack problem. Math. Program., 55(1-6):99-108, 1992.
12. T. Sandholm and S. Suri. Market clearability. In Proceedings of IJCAI'01, pages 1145-1151, 2001.