A dynamic programming approach for agent's bidding strategy in TAC‐SCM game

A dynamic programming approach for agent's bidding strategy in TAC‐SCM game

0.00 Avg rating0 Votes
Article ID: iaor20123880
Volume: 14
Issue: 2
Start Page Number: 121
End Page Number: 134
Publication Date: May 2012
Journal: International Journal of Operational Research
Authors: , ,
Keywords: e-commerce, supply & supply chains, programming: dynamic, optimization
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.

Reviews

Required fields are marked *. Your email address will not be published.