IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v14y2012i2p121-134.html
   My bibliography  Save this article

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

Author

Listed:
  • Soheil Sibdari
  • Xiaoqin Shelley Zhang
  • Saban Singh

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.

Suggested Citation

  • Soheil Sibdari & Xiaoqin Shelley Zhang & Saban Singh, 2012. "A dynamic programming approach for agent's bidding strategy in TAC-SCM game," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 14(2), pages 121-134.
    • Handle: RePEc:ids:ijores:v:14:y:2012:i:2:p:121-134
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=46644
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yoon Sang Lee & Riyaz Sikora, 2019. "Application of adaptive strategy for supply chain agent," Information Systems and e-Business Management, Springer, vol. 17(1), pages 117-157, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:14:y:2012:i:2:p:121-134. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.