The paper describes the design of the agent BOTTICELLI, a finalist in the 2003 Trading Agent Competition in Supply Chain Management (TAC SCM). In TAC SCM, a simulated computer manufacturing scenario, BOTTICELLI competes with other agents to win customer orders and negotiates with suppliers to procure the components necessary to complete its orders. We formalize subproblems that dictate BOTTICELLI's behavior. Stochastic programming approaches to bidding and scheduling are developed in attempt to solve these problems optimally. In addition, we describe greedy methods that yield useful approximations. Test results compare the performance and computational effciency of these two techniques.
ACM SIGecom Exchanges – Association for Computing Machinery
Published: Feb 1, 2004