Negotiating Complex Contracts

Yaneer Bar-Yam; Hiroki Sayama; Peyman Faratin; Mark Klein

Negotiating Complex Contracts

Yaneer Bar-Yam
, Hiroki Sayama
, Peyman Faratin
, Mark Klein

Watson Dean's Office

Binghamton University

NewEngland Complex Systems Institute
Massachusetts Institute of Technology

Research output: Contribution to conference › Paper › peer-review

Abstract

Work to date on computational models of negotiation has focused almost exclusively on defining contracts consisting of one or a few independent issues, linear utility functions, and tractable contract spaces. Many real-world contracts, by contrast, are much more complex, consisting of multiple inter-dependent issues, nonlinear utility functions, and intractably large contract spaces. This paper describes a simulated annealing based approach appropriate for negotiating such complex contracts, evaluates its efficacy, and suggests potentially promising avenues for defining more efficient algorithms for negotiating complex contracts.

Original language	English
Pages	135-141
Number of pages	7
State	Published - 2001
Event	2001 AAAI Fall Symposium - North Falmouth, United States Duration: Nov 2 2001 → Nov 4 2001

Conference

Conference	2001 AAAI Fall Symposium
Country/Territory	United States
City	North Falmouth
Period	11/2/01 → 11/4/01

Cite this

@conference{f5dc114fcfdc4d48ad97bca8b8dba657,

title = "Negotiating Complex Contracts",

abstract = "Work to date on computational models of negotiation has focused almost exclusively on defining contracts consisting of one or a few independent issues, linear utility functions, and tractable contract spaces. Many real-world contracts, by contrast, are much more complex, consisting of multiple inter-dependent issues, nonlinear utility functions, and intractably large contract spaces. This paper describes a simulated annealing based approach appropriate for negotiating such complex contracts, evaluates its efficacy, and suggests potentially promising avenues for defining more efficient algorithms for negotiating complex contracts.",

author = "Yaneer Bar-Yam and Hiroki Sayama and Peyman Faratin and Mark Klein",

year = "2001",

language = "English",

pages = "135--141",

}

TY - CONF

T1 - Negotiating Complex Contracts

AU - Bar-Yam, Yaneer

AU - Sayama, Hiroki

AU - Faratin, Peyman

AU - Klein, Mark

PY - 2001

Y1 - 2001

N2 - Work to date on computational models of negotiation has focused almost exclusively on defining contracts consisting of one or a few independent issues, linear utility functions, and tractable contract spaces. Many real-world contracts, by contrast, are much more complex, consisting of multiple inter-dependent issues, nonlinear utility functions, and intractably large contract spaces. This paper describes a simulated annealing based approach appropriate for negotiating such complex contracts, evaluates its efficacy, and suggests potentially promising avenues for defining more efficient algorithms for negotiating complex contracts.

AB - Work to date on computational models of negotiation has focused almost exclusively on defining contracts consisting of one or a few independent issues, linear utility functions, and tractable contract spaces. Many real-world contracts, by contrast, are much more complex, consisting of multiple inter-dependent issues, nonlinear utility functions, and intractably large contract spaces. This paper describes a simulated annealing based approach appropriate for negotiating such complex contracts, evaluates its efficacy, and suggests potentially promising avenues for defining more efficient algorithms for negotiating complex contracts.

UR - https://www.scopus.com/pages/publications/85169835957

M3 - Paper

SP - 135

EP - 141

T2 - 2001 AAAI Fall Symposium

Y2 - 2 November 2001 through 4 November 2001

ER -

Negotiating Complex Contracts

Abstract

Conference

Other files and links

Fingerprint

Cite this