Optimal negotiation decision functions in time-sensitive domains
Optimal negotiation decision functions in time-sensitive domains
The last two decades have seen a growing interest in automated agents that are able to negotiate on behalf of human negotiators in a wide variety of negotiation domains. One key aspect of a successful negotiating agent is its ability to make appropriate concessions at the right time, especially when there are costs associated with the duration of the negotiation. However, so far, there is no fundamental approach on how much to concede at every stage of the negotiation in such time-sensitive domains. We introduce an efficient solution based on simultaneous search, which is able to select the optimal sequence of offers that maximizes expected payoff, given the agent's beliefs about the opponent. To this end, we show that our approach is consistent with known theoretical results and we demonstrate both its effectiveness and natural properties by applying it to a number of typical negotiation scenarios. Finally, we show in a number of experiments that our solution outperforms other state of the art strategy benchmarks.
190-197
Baarslag, Tim
a7c541d8-8141-467b-a08c-7a81cd69920e
Gerding, Enrico H.
d9e92ee5-1a8c-4467-a689-8363e7743362
Aydogan, Reyhan
2ef7ca96-a5f0-48a1-91f3-1beae0ff5e5d
schraefel, m.c.
ac304659-1692-47f6-b892-15113b8c929f
4 February 2016
Baarslag, Tim
a7c541d8-8141-467b-a08c-7a81cd69920e
Gerding, Enrico H.
d9e92ee5-1a8c-4467-a689-8363e7743362
Aydogan, Reyhan
2ef7ca96-a5f0-48a1-91f3-1beae0ff5e5d
schraefel, m.c.
ac304659-1692-47f6-b892-15113b8c929f
Baarslag, Tim, Gerding, Enrico H., Aydogan, Reyhan and schraefel, m.c.
(2016)
Optimal negotiation decision functions in time-sensitive domains.
In Proceedings - 2015 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology, WI-IAT 2015.
vol. 2,
IEEE.
.
(doi:10.1109/WI-IAT.2015.161).
Record type:
Conference or Workshop Item
(Paper)
Abstract
The last two decades have seen a growing interest in automated agents that are able to negotiate on behalf of human negotiators in a wide variety of negotiation domains. One key aspect of a successful negotiating agent is its ability to make appropriate concessions at the right time, especially when there are costs associated with the duration of the negotiation. However, so far, there is no fundamental approach on how much to concede at every stage of the negotiation in such time-sensitive domains. We introduce an efficient solution based on simultaneous search, which is able to select the optimal sequence of offers that maximizes expected payoff, given the agent's beliefs about the opponent. To this end, we show that our approach is consistent with known theoretical results and we demonstrate both its effectiveness and natural properties by applying it to a number of typical negotiation scenarios. Finally, we show in a number of experiments that our solution outperforms other state of the art strategy benchmarks.
Text
simultaneous-search.pdf
- Other
More information
e-pub ahead of print date: 4 February 2016
Published date: 4 February 2016
Venue - Dates:
2015 IEEE/WIC/ACM International Joint Conferences on Web Intelligence (WI) and Intelligent Agent Technologies (IAT), Singapore, Singapore, 2015-12-06 - 2015-12-09
Organisations:
Agents, Interactions & Complexity
Identifiers
Local EPrints ID: 381126
URI: http://eprints.soton.ac.uk/id/eprint/381126
PURE UUID: 83d88002-7ddb-4d7a-8cf8-201bc79fd31b
Catalogue record
Date deposited: 23 Sep 2015 16:47
Last modified: 17 Mar 2024 03:03
Export record
Altmetrics
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics
