Automated Negotiation from Declarative Contract Descriptions

Our approach for automating the negotiation of business contracts proceeds in three broad steps. First, determine the structure of the negotiation process byapplying general knowledge about auctions and domain-specific knowledge about the contract subject along with preferences from potential buyers and sellers. Second, translate the determined negotiation structure into an operational specification for an auction platform. Third, map the negotiation results to a final contract. We have implemented a prototype which supports these steps, employing a declarative specification (in Courteous Logic Programs) of (1) high-level knowledge about alternative negotiation structures, (2) general-case rules about auction parameters, (3) rules to map the auction parameters to a specific auction platform, and (4) special-case rules for subject domains. We demonstrate the flexibility of this approach by automatically generating several alternative negotiation structures for a previous domain: travel-shopping in a trading agent competition.

[1]  Paul R. Milgrom,et al.  Putting Auction Theory to Work: The Simultaneous Ascending Auction , 1999, Journal of Political Economy.

[2]  Benjamin N. Grosof.  Prioritized Conflict Handling for Logic Programs , 1997, ILPS.

[3]  Craig Milo Rogers,et al.  Controlling Supplier Selection in an Automated Purchasing System , 1999 .

[4]  Michael P. Wellman,et al.  A Parametrization of the Auction Design Space , 2001, Games Econ. Behav..

[5]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, Lecture Notes in Computer Science.

[6]  T. Ishida,et al.  A Trading Agent Competition for the Research Community , 1999 .

[7]  Tuomas Sandholm.  eMediator: A Next Generation Electronic Commerce Server , 2002, Comput. Intell..

[8]  Victoria Ungureanu,et al.  A mechanism for establishing policies for electronic commerce , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[9]  Shou-De Lin,et al.  Designing the Market Game for a Trading Agent Competition , 2001, IEEE Internet Comput..

[10]  Benjamin N. Grosof.  Ibm Research Report Building Commercial Agents: an Ibm Research Perspective (invited Talk) , 2007 .

[11]  A. Roth,et al.  Last Minute Bidding and the Rules for Ending Second-Price Auctions: Theory and Evidence from a Natural Experiment on the Internet , 2000 .

[12]  Benjamin N. Grosof.  Prioritized conflict handing for logic programs , 1997, International Conference on Logic Programming.

[13]  Michael P. Wellman,et al.  Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..

[14]  Asit Dan,et al.  The Coyote Project: Framework for Multi-party E-Commerce , 1998, ECDL.

[15]  Tuomas Sandholm,et al.  Approaches to winner determination in combinatorial auctions , 2000, Decis. Support Syst..

[16]  F. Branco.  The Design of Multidimensional Auctions , 1997 .

[17]  John Rust,et al.  The Double Auction Market , 1989 .

[18]  David Scott Warren,et al.  The XSB Programming System , 1993, Workshop on Programming with Logic Databases , ILPS.

[19]  Benjamin N. Grosof,et al.  A declarative approach to business rules in contracts: courteous logic programs in XML , 2015, EC '99.

[20]  Benjamin N. Grosof,et al.  Toward a Declarative Language for Negotiating Executable Contracts , 2003 .

[21]  Manoj Kumar,et al.  Internet Auctions , 1998, USENIX Workshop on Electronic Commerce.

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