Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
TAC-03: a supply-chain trading competition
Sadeh N., Arunachalam R., Eriksson J., Finne N., Janson S.  AI Magazine 24 (1): 92-94, 2003. Type: Article
Date Reviewed: Aug 21 2003

The Trading Agent Competition (TAC) has become a tradition since its beginning in 2000. The competition seeks to study automatic trading strategies, by focusing the research community on the development of agent-based solutions to a common trading scenario. The fourth edition of this competition, which took place in August 2003, proposed a novel scenario: the supply-chain game. This scenario sought to focus research on the use of automatic agents in the context of dynamic supply-chain management.

A short overview is provided in this paper of this supply-chain game, proposed for TAC-03, and details the main rules of the game. It provides pointers to several Web sites for more comprehensive information on the competition. The main Web site for the 2003 game is www.sics.se/tac/.

Reviewer:  A. Florea Review #: CR128154 (0401-0091)
Bookmark and Share
 
Plan Execution, Formation, And Generation (I.2.8 ... )
 
 
Cognitive Simulation (I.2.0 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Plan Execution, Formation, And Generation": Date
Visibility-based optimal path and motion planning
Wang P.,  Springer Publishing Company, Incorporated, Cham, Switzerland, 2015. 198 pp. Type: Book (978-3-319097-78-7)
Nov 4 2014
Understanding planning tasks: domain complexity and heuristic decomposition (Lecture Notes in Computer Science 4529)
Helmert M.,  Springer Publishing Company, Incorporated, 2008. 270 pp. Type: Book (9783540777229)
Jul 18 2008
Multi-stage ship control in a fuzzy environment
Pietrzykowski Z.  In Enhanced methods in computer security, biometric and artificial intelligence systems. London: Springer-Verlag, 2005. Type: Book Chapter
Sep 28 2006
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy