Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/1768
Full metadata record
DC FieldValueLanguage
dc.creatorGrosof, Benjamin-
dc.creatorReeves, Daniel-
dc.creatorWellman, Michael-
dc.date2002-10-23T19:08:03Z-
dc.date2002-10-23T19:08:03Z-
dc.date2002-10-23T19:08:03Z-
dc.date.accessioned2013-05-31T20:01:22Z-
dc.date.available2013-05-31T20:01:22Z-
dc.date.issued2013-06-01-
dc.identifierhttp://hdl.handle.net/1721.1/1768-
dc.identifier.urihttp://koha.mediu.edu.my:8181/jspui/handle/1721-
dc.descriptionOur approach for automating the negotiation of business contracts proceeds in three broad steps. First, determine the structure of the negotiation process by applying general knowledge about auctions and domain-specific knowledge about the contract subject along with preferences from po- tential buyers and sellers. Second, translate the determined negotiation structure into an operational specication for an auction platform. Third, map the negotiation results to a nal contract. We have implemented a prototype which supports these steps, employing a declarative specication (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 specic auction platform, and (4) special- case rules for subject domains. We demonstrate the exi- bility of this approach by automatically generating several alternative negotiation structures for a previous domain: travel-shopping in a trading agent competitio-
dc.format250408 bytes-
dc.formatapplication/pdf-
dc.languageen_US-
dc.relationMIT Sloan School of Management Working Paper;4188-01-
dc.relationeBusiness@MIT;114-
dc.subjectNegotiations-
dc.subjectContracts-
dc.subjectAuctions-
dc.subjectDomain-specific knowledge-
dc.titleAutomated Negotiation from Declarative Contract Descriptions-
Appears in Collections:MIT Items

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.