Protocols for negotiating complex contracts
Name
intellsys-03.pdf
Size
57.4 KB
Format
Adobe PDF
Checksum (MD5)
e72d6a482a0e62d6dcf4533d48ba0ac0
Author(s)
Sayama, H.
Bar-Yam, Y.
Klein, Mark
Faratin, Peyman
Date Issued
2003
Journal
IEEE Intelligent Systems
Publisher
Institute of Electrical and Electronics Engineers (IEEE
Citation
Klein, M. et al. “Protocols for Negotiating Complex Contracts.” IEEE Intelligent Systems 18, 6 (November 2003): 32–38 © 2003 IEEE
Version
Original manuscript
Abstract
Research to date on negotiation protocols has focused almost exclusively on defining simple contracts consisting of one or a few independent issues and a relatively small number of possible contracts. Many real-world contracts, in contrast, are much more complex, consisting of multiple interdependent issues and intractably large contract spaces. The family of negotiation protocols we've developed make substantial progress toward achieving near-optimal outcomes for negotiations with binary issue dependencies. We propose a simulated annealing-based approach, a refined version based on a parity-maintaining annealing mediator, and an unmediated version of the negotiation protocol. Keywords: protocols; contracts; proposals; simulated annealing; hamming distance; pareto optimization; aggregates; utility theory, software agents, contracts, simulated annealing; utility function; negotiation protocols; contract; binary issue dependency; simulated annealing-based approach; parity-maintaining annealing mediator; software agent
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Sloan School of Management
Massachusetts Institute of Technology. Center for Collective Intelligence
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/MIS.2003.1249167
