Scheduling tasks using combinatorial auctions : the MAGNET approach ⋆

We consider the problem of rational, self-interested, economic agents who must negotiate with each other in a market environment in order to carry out their plans. Customer agents express their plans in the form of task networks with temporal and precedence constraints. A combinatorial reverse auction allows supplier agents to submit bids specifying prices for combinations of tasks, along with time windows and duration data that the customer may use to compose a work schedule. We describe the consequences of allowing the advertised task network to contain schedule infeasibilities, and show how to resolve them in the auction winner-determination process.

[1]  R. Faure,et al.  Introduction to operations research , 1968 .

[2]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[3]  R. McAfee,et al.  Auctions and Bidding , 1986 .

[4]  Mark S. Boddy,et al.  Deliberation Scheduling for Problem Solving in Time-Constrained Environments , 1994, Artif. Intell..

[5]  Jeffrey K. MacKie-Mason,et al.  Generalized Vickrey Auctions , 1994 .

[6]  Jeffrey S. Rosenschein and Gilad Zlotkin.  Rules of Encounter , 1994 .

[7]  Mark S. Fox,et al.  An Activity Ontology for Enterprise Modelling , 1994 .

[8]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[9]  Thomas Dean,et al.  Anticipating computational demands when solving time-critical decision-making problems , 1995 .

[10]  V. Lesser,et al.  On Automated Contracting in Multi-enterprise Manufacturing , 1995 .

[11]  Victor Lesser,et al.  Negotiation among self-interested computationally limited agents , 1996 .

[12]  Martha E. Pollack,et al.  Planning in Dynamic Environments: The DIPART System , 1996 .

[13]  Pablo Noriega,et al.  FM96.5 A Java-based Electronic Auction House , 1997, PAAM.

[14]  Pattie Maes,et al.  Kasbah: An Agent Marketplace for Buying and Selling Goods , 1996, PAAM.

[15]  Maria L. Gini,et al.  Magma: An Agent Based Virtual Market for Electronic Commerce , 1997, Appl. Artif. Intell..

[16]  Michael P. Wellman.  Market-aware agents for a multiagent world , 1997, Robotics Auton. Syst..

[17]  Katia P. Sycara,et al.  Middle-Agents for the Internet , 1997, IJCAI.

[18]  Nicholas R. Jennings,et al.  Negotiation decision functions for autonomous agents , 1998, Robotics Auton. Syst..

[19]  Michael P. Wellman,et al.  The Michigan Internet AuctionBot: a configurable auction server for human and software agents , 1998, AGENTS '98.

[20]  Katia Sycara,et al.  The RETSINA Multiagnet System: Towards Integrating Planning, Execution and Information Gathering. , 1998 .

[21]  David E. Wilkins,et al.  A Multiagent Planning Architecture , 1998, AIPS.

[22]  Yannis Bakos,et al.  The emerging role of electronic marketplaces on the Internet , 1998, CACM.

[23]  Maria L. Gini,et al.  MAGNET: A Multi-Agent Contracting System for Plan Execution , 1998 .

[24]  Robert W. Ivester,et al.  A ROBUST PROCESS ONTOLOGY FOR MANUFACTURING SYSTEMS INTEGRATION , 1998 .

[25]  Matthias Klusch,et al.  Dynamic service matchmaking among agents in open information environments , 1999, SGMD.

[26]  Maria L. Gini,et al.  Mixed-initiative decision support in agent-based automated contracting , 2000, AGENTS '00.

[27]  Noam Nisan,et al.  Bidding and allocation in combinatorial auctions , 2000, EC '00.

[28]  Moshe Tennenholtz,et al.  An Algorithm for Multi-Unit Combinatorial Auctions , 2000, AAAI/IAAI.

[29]  David C. Parkes,et al.  Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.

[30]  Arne Andersson,et al.  Integer programming for combinatorial auction winner determination , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[31]  Craig Boutilier,et al.  Solving Combinatorial Auctions Using Stochastic Local Search , 2000, AAAI/IAAI.

[32]  Michael P. Wellman,et al.  Combinatorial auctions for supply chain formation , 2000, EC '00.

[33]  David C. Parkes,et al.  An auction-based method for decentralized train scheduling , 2001, AGENTS '01.

[34]  Craig Boutilier,et al.  Bidding Languages for Combinatorial Auctions , 2001, IJCAI.

[35]  Maria L. Gini,et al.  Decision Processes in Agent-Based Automated Contracting , 2001, IEEE Internet Comput..

[36]  Michael P. Wellman,et al.  Auction Protocols for Decentralized Scheduling , 2001, Games Econ. Behav..

[37]  Maria Gini,et al.  An integer programming formulation of the bid evaluation problem for coordinated tasks , 2002 .

[38]  Maria L. Gini,et al.  Bidtree Ordering in IDA* Combinatorial Auction Winner-Determination with Side Constraints , 2002, AMEC.

[39]  Peter Stone,et al.  ATTac-2001: A Learning, Autonomous Bidding Agent , 2002, AMEC.

[40]  Maria L. Gini,et al.  Solving combinatorial auctions with temporal constraints in economic agents , 2002 .

[41]  Tuomas Sandholm,et al.  Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..

[42]  Subhash Suri,et al.  BOB: Improved winner determination in combinatorial auctions and generalizations , 2003, Artif. Intell..

[43]  Maria L. Gini,et al.  Asking the right question: Risk and expectation in multiagent contracting , 2003, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[44]  Sven de Vries,et al.  Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..

[45]  John Collins,et al.  The Supply Chain Management Game for the 2007 Trading Agent Competition , 2004 .