TY - GEN
T1 - Negotiation in exploration-based environment
AU - Sofer, Israel
AU - Same, David
AU - Hassidim, Avinatan
PY - 2012
Y1 - 2012
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84868294705&partnerID=8YFLogxK
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84868294705
SN - 9781577355687
T3 - Proceedings of the National Conference on Artificial Intelligence
SP - 1450
EP - 1456
BT - AAAI-12 / IAAI-12 - Proceedings of the 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference
T2 - 26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12
Y2 - 22 July 2012 through 26 July 2012
ER -