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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE
2018
|
| Online Access: | http://hdl.handle.net/1721.1/113705 |
| _version_ | 1811076176449372160 |
|---|---|
| author | Sayama, H. Bar-Yam, Y. Klein, Mark Faratin, Peyman |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Sayama, H. Bar-Yam, Y. Klein, Mark Faratin, Peyman |
| author_sort | Sayama, H. |
| collection | MIT |
| description | 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 |
| first_indexed | 2024-09-23T10:17:35Z |
| format | Article |
| id | mit-1721.1/113705 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T10:17:35Z |
| publishDate | 2018 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE |
| record_format | dspace |
| spelling | mit-1721.1/1137052024-07-19T19:27:18Z Protocols for negotiating complex contracts Sayama, H. Bar-Yam, Y. Klein, Mark Faratin, Peyman Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Sloan School of Management Massachusetts Institute of Technology. Center for Collective Intelligence Klein, Mark Klein, Mark Faratin, Peyman 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 2018-02-16T16:00:33Z 2018-02-16T16:00:33Z 2003 Article http://purl.org/eprint/type/JournalArticle 1541-1672 http://hdl.handle.net/1721.1/113705 Klein, M. et al. “Protocols for Negotiating Complex Contracts.” IEEE Intelligent Systems 18, 6 (November 2003): 32–38 © 2003 IEEE en_US http://dx.doi.org/10.1109/MIS.2003.1249167 IEEE Intelligent Systems 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. application/pdf Institute of Electrical and Electronics Engineers (IEEE Klein |
| spellingShingle | Sayama, H. Bar-Yam, Y. Klein, Mark Faratin, Peyman Protocols for negotiating complex contracts |
| title | Protocols for negotiating complex contracts |
| title_full | Protocols for negotiating complex contracts |
| title_fullStr | Protocols for negotiating complex contracts |
| title_full_unstemmed | Protocols for negotiating complex contracts |
| title_short | Protocols for negotiating complex contracts |
| title_sort | protocols for negotiating complex contracts |
| url | http://hdl.handle.net/1721.1/113705 |
| work_keys_str_mv | AT sayamah protocolsfornegotiatingcomplexcontracts AT baryamy protocolsfornegotiatingcomplexcontracts AT kleinmark protocolsfornegotiatingcomplexcontracts AT faratinpeyman protocolsfornegotiatingcomplexcontracts |