Skip to main content

Classification Driven Detection of Opportunistic Bids in TAC SCM

  • Conference paper
  • First Online:
Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets (AMEC 2014, AMEC 2013, TADA 2014, TADA 2013)

Abstract

The main objective of a bidding agent in TAC SCM is to get profitable orders and to get enough orders to keep the production going. There is a delicate balance that the bidding agent needs to maintain while deciding on which specific orders to bid and what bidding price to set. In this highly complex bidding problem with (i) many inter-dependencies, (ii) multiple information flows, (iii) historical data and knowledge, the bidding agent can bid for a few opportunistic orders at a reasonably higher price, which gives higher profit. In this paper, we use classification to determine opportunistic bids to increase our profit. Our solution is robust and adapts according to the dynamic changes in the market condition and the competition provided by the competing agents. Our results show that classification using our opportunistic approach contributes to a significant percentage of our agent’s profit.

Trading Agent Competition for Supply Chain Management.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    We use Cricket game analogy – Singles are used to keep the scoreboard ticking, while Fours and Sixes are highly risky but opportunistic.

  2. 2.

    Demonstration for Taxi scheduling is out of the scope of this paper.

  3. 3.

    Need to improve coordination between the procurement module and the bidding module of our agent.

References

  1. Collins, J., Arunachalam, R., Sadeh, N., Eriksson, J., Finne, N., Janson, S.: The supply chain management game for the 2007 TAC. Technical report CMU-ISRI-07-100, Carnegie Mellon University (2007)

    Google Scholar 

  2. Vicky, P., Cassaigne, N.: A critical analysis of bid pricing models and support tool. In: 2000 IEEE International Conference on Systems, Man, and Cybernetics, vol. 3, pp. 2098–2103 (2000)

    Google Scholar 

  3. Pardoe, D., Stone, P.: Bidding for customer orders in TAC SCM. In: Faratin, P., Rodríguez-Aguilar, J.-A. (eds.) AMEC 2004. LNCS (LNAI), vol. 3435, pp. 143–157. Springer, Heidelberg (2006)

    Google Scholar 

  4. Kiekintveld, C., Miller, J., Jordan, P.R., Callender, L.F., Wellman, M.P.: Forecasting market prices in a supply chain game. Electron. Commer. Rec. Appl. 8(2), 63–77 (2009)

    Article  Google Scholar 

  5. Jordan, P.R., Kiekintveld, C., Wellman, M.P.: Empirical game-theoretic analysis of the TAC Supply Chain game. In: AAMAS’07, pp. 193:1–193:8. ACM, New York (2007)

    Google Scholar 

  6. Benisch, M., Greenwald, A., Grypari, I., Lederman, R., Naroditskiy, V., Tschantz, M.: Botticelli: a supply chain management agent. ACM Trans. Comp. Logic., 1174–1181 (2004)

    Google Scholar 

  7. Kovalchuk, Y., Fasli, M.: Adaptive strategies for predicting bidding prices in supply chain management. In: 10th ICEC, pp. 6:1–6:10. ACM, New York (2008)

    Google Scholar 

  8. He, M., Rogers, A., Luo, X., Jennings, N.R.: Designing a successful trading agent for supply chain management. In: AAMAS ’06, pp. 1159–1166. ACM, New York (2006)

    Google Scholar 

  9. Collins, J., Ketter, W., Gini, M.: Flexible decision control in an autonomous trading agent. Electron. Commer. Rec. Appl. 8(2), 91–105 (2009)

    Article  Google Scholar 

  10. Ketter, W., Collins, J., Gini, M., Gupta, A., Schrater, P.: Detecting and forecasting economic regimes in multi-agent automated exchanges. Decis. Support Syst. 47(4), 307–318 (2009)

    Article  Google Scholar 

  11. Chatzidimitriou, K.C., Symeonidis, A.L., Mitkas, P.A.: Policy search through adaptive function approximation for bidding in TAC SCM. In: David, E., Kiekintveld, C., Robu, V., Shehory, O., Stein, S. (eds.) AMEC 2012 and TADA 2012. LNBIP, vol. 136, pp. 16–29. Springer, Heidelberg (2013)

    Google Scholar 

  12. Kiekintveld, C., Wellman, M.P., Singh, S., Estelle, J., Vorobeychik, Y., Soni, V., Rudary, M.: Distributed feedback control for decision making on supply chains. In: 14th ICAPS, pp. 384–392 (2004)

    Google Scholar 

  13. Stan, M., Stan, B., Florea, A.M.: A dynamic strategy agent for supply chain management. In: SYNASC’06, pp. 227–232. IEEE Computer Society, Washington, DC (2006)

    Google Scholar 

  14. Glaschenko, A., Ivaschenko, A., Rzevski, G., Skobelev, P.: Multi-agent real time scheduling system for taxi companies (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Anuj Toshniwal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Toshniwal, A., Porwal, K., Karlapalem, K. (2014). Classification Driven Detection of Opportunistic Bids in TAC SCM. In: Ceppi, S., et al. Agent-Mediated Electronic Commerce. Designing Trading Strategies and Mechanisms for Electronic Markets. AMEC AMEC TADA TADA 2014 2013 2014 2013. Lecture Notes in Business Information Processing, vol 187. Springer, Cham. https://doi.org/10.1007/978-3-319-13218-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13218-1_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13217-4

  • Online ISBN: 978-3-319-13218-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics