Abstract
This paper studies repetitive negotiation over the execution of an exploration process between two self-interested, fully rational agents in a full information environment with side payments. A key aspect of the protocol is that the exploration's execution may interleave with the negotiation itself, inflicting some degradation on the exploration's flexibility. The advantage of this form of negotiation is in enabling the agents supervising that the exploration's execution takes place in its agreed form as negotiated. We show that in many cases, much of the computational complexity of the new protocol can be eliminated by solving an alternative negotiation scheme according to which the parties first negotiate the exploration terms as a whole and then execute it. As demonstrated in the paper, the solution characteristics of the new protocol are somehow different from those of legacy negotiation protocols where the execution of the agreement reached through the negotiation is completely separated from the negotiation process. Furthermore, if the agents are given the option to control some of the negotiation protocol parameters, the resulting exploration may be suboptimal. In particular we show that the increase in an agent's expected utility in such cases is unbounded and so is the resulting decrease in the social welfare. Surprisingly, we show that further increasing one of the agents' level of control in some of the negotiation parameters enables bounding the resulting decrease in the social welfare.
Original language | English |
---|---|
Pages | 1450-1456 |
Number of pages | 7 |
State | Published - 2012 |
Event | 26th AAAI Conference on Artificial Intelligence, AAAI 2012 - Toronto, Canada Duration: 22 Jul 2012 → 26 Jul 2012 |
Conference
Conference | 26th AAAI Conference on Artificial Intelligence, AAAI 2012 |
---|---|
Country/Territory | Canada |
City | Toronto |
Period | 22/07/12 → 26/07/12 |
Bibliographical note
Publisher Copyright:Copyright © 2012, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
This work was supported in part by ISF/BSF grants 1401/09 and 2008-404.
Funders | Funder number |
---|---|
United States-Israel Binational Science Foundation | 2008-404, 1401/09 |
Israel Science Foundation |