Protocols for negotiating complex contracts

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 interdependen...

Full description

Saved in:
Bibliographic Details
Published inIEEE intelligent systems Vol. 18; no. 6; pp. 32 - 38
Main Authors Klein, M., Faratin, P., Sayama, H., Bar-Yam, Y.
Format Journal Article
LanguageEnglish
Published Los Alamitos IEEE 01.11.2003
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Aggregates
Annealing
Binary system
Contract negotiations
Contracts
Hamming distance
Intelligent agents
Negotiations
Pareto optimization
Proposals
Protocol
Protocols
Simulated annealing
Simulation
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1541-1672
1941-1294
DOI:10.1109/MIS.2003.1249167