Analysis Of TAC SCM Game Scenario

1362 Words3 Pages

In the previous chapter we have introduced and explained the TAC SCM game scenario.
In this chapter, we present the related work in literature with respect to TAC SCM.
The trading agent competition (TAC)is one of the few successful attempts by the AI community to devise competitive game scenarios that focus the energies of the research community on challenging problems [5, 6]. Such competitions can be an effective way to promote and drive research in complex domains and achieve better understanding, free of the complexities and risk of operating in real-world environments. [7] discusses its significance in the context of tackling challenging problems in today’s global networked economy as well as AI research, and some of the advances it has lead to over the years.
TAC SCM is a classic optimization problem with constraints and uncertainty. It presents a complex dynamic scenario, capturing the various challenges of supply chain management. There are three key issues in TAC SCM scenario that an agent needs to address: dealing with considerable uncertainty in a highly dynamic market, while competing with other self-interested strategic agents [8]. Developing an agent is a correspondingly difficult task.
Several teams from top institutes and research communities around the world have participated in the competition. In [9], the authors present the response from an informal survey which they sent to the TAC SCM community in 2007. They provide an overview of the design choices made and the specific architectural emphases the teams identified in their agent designs.
Most of the agents use multi-agent architecture to tackle the problem. They divide the problem into a number of sub-problems and solve these sub-problems using different appro...

... middle of paper ...

...he TacTex agent bases its actions on its predictions regarding the future of the economy in the game. The Botticelli team
[16] shows how the problems faced by TAC SCM agents can be modeled as mathematical programming problems, and offers heuristic algorithms for bidding on RFQs and scheduling orders. PhantAgent uses heuristic approximations to solve the sub- problems [41]. Mertacor [42] exploits the integration of techniques from the Operations
Research (OR) literature, heuristics and adaptive algorithms, as well as statistical modeling. CrocodileAgent [43] is built on the IKB (Information, Knowledge, and Behavior) model [44], a three layered agent-based framework. MinneTAC uses a component based framework [9]. All data to be shared among components are kept in the Repository, which acts as a blackboard [45]. Other agent architectures are described in [31, 46–49].

Open Document