The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - November/December (2003 vol.18)
pp: 32-38
Mark Klein , Massachusetts Institute of Technology
Peyman Faratin , Massachusetts Institute of Technology
Hiroki Sayama , University of Electro-Communications
Yaneer Bar-Yam , New England Complex Systems Institute
ABSTRACT
<p>Work to date on negotiation protocols has focused almost exclusively on defining contracts consisting of one or a few independent issues and relatively small number of possible contracts. Many real-world contracts, by contrast, are much more complex, consisting of multiple interdependent issues and intractably large contract spaces. This paper describes a simulated annealing based approach appropriate for negotiating such complex contracts that achieves near-optimal outcomes for negotiations with binary issue dependencies.</p>
INDEX TERMS
contracts, negotiation protocol, multiple interdependent issues, prisoner's dilemma, simulated annealing
CITATION
Mark Klein, Peyman Faratin, Hiroki Sayama, Yaneer Bar-Yam, "Protocols for Negotiating Complex Contracts", IEEE Intelligent Systems, vol.18, no. 6, pp. 32-38, November/December 2003, doi:10.1109/MIS.2003.1249167
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool