A dynamic programming approach for agent's bidding strategy in TAC-SCM game Online publication date: Sun, 11-Jan-2015
by Soheil Sibdari; Xiaoqin Shelley Zhang; Saban Singh
International Journal of Operational Research (IJOR), Vol. 14, No. 2, 2012
Abstract: Intelligent agents have been developed for a number of e-commerce applications including supply chain management. In trading agent competition for supply chain management (TAC SCM), several manufacturer agents compete in a reverse auction in order to sell assembled computers to customers. The manufacturer agent's tasks include acquiring supplies, selling products and managing its local manufacturing process. The agent decide whether to accept an arriving bid in order to maximise its long-term expected prot. In this paper, we use dynamic programming to provide a pricing strategy for the TAC SCM. We consider a competition between an individual manufacturer agent and other automated agents in TAC SCM. The experiment results show that this strategy improves the agent's revenue signicantly comparing to several other heuristics in the current practice. This approach can also be applied to similar bidding problems in other e-commerce applications.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook