TY - JOUR
T1 - Negotiating Complex Contracts
AU - Klein, Mark
AU - Faratin, Peyman
AU - Sayama, Hiroki
AU - Bar-Yam, Yaneer
N1 - Funding Information:
This work was supported by funding from the DARPA Control of Agent-Based Systems (CoABS) program, and the NSF Computation and Social Systems program.
PY - 2003/3
Y1 - 2003/3
N2 - Work to date on computational models of negotiation has focused almost exclusively on defining contracts consisting of one or a few independent issues and tractable contract spaces. Many real-world contracts, by contrast, are much more complex, consisting of multiple inter-dependent issues and intractably large contract spaces. This paper describes a simulated annealing based approach appropriate for negotiating such complex contracts that achieves near optimal social welfares for negotiations with binary issue dependencies.
AB - Work to date on computational models of negotiation has focused almost exclusively on defining contracts consisting of one or a few independent issues and tractable contract spaces. Many real-world contracts, by contrast, are much more complex, consisting of multiple inter-dependent issues and intractably large contract spaces. This paper describes a simulated annealing based approach appropriate for negotiating such complex contracts that achieves near optimal social welfares for negotiations with binary issue dependencies.
KW - Interdependent issues
KW - Non-linear negotiation
UR - http://www.scopus.com/inward/record.url?scp=0037256778&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037256778&partnerID=8YFLogxK
U2 - 10.1023/A:1023068821218
DO - 10.1023/A:1023068821218
M3 - Article
AN - SCOPUS:0037256778
VL - 12
SP - 111
EP - 125
JO - Group Decision and Negotiation
JF - Group Decision and Negotiation
SN - 0926-2644
IS - 2
ER -