Agenda-Based Automated Negotiation Through Utility Decomposition
Agenda-Based Automated Negotiation Through Utility Decomposition
复制标题
通过效用分解进行基于议程的自动谈判
DOI：
10.1007/978-981-99-0561-4_7
复制
发表时间：
2023
期刊：
影响因子：
--
通讯作者：
Rafik Hadfi and Takayuki Ito
中科院分区：
文献类型：
--
作者：
Zongcan Li;Rafik Hadfi and Takayuki Ito
谈判的成功主要取决于谈判者的策略和问题域。谈判者依赖议程来简化谈判过程并达成更好的协议，这是很常见的。当谈判者在多个问题上定义了偏好时，这一点尤其正确。利用议程来探索和分解问题之间的相互依存关系是解决这一问题的一种方式。通过效用分解和自下而上的议程构建，将经典的分而治之的方法应用于自动谈判。这种方法不是从谈判的顶层强加议程，而是在考虑到代理人的个别效用职能和问题之间的关系的情况下，自下而上地建立议程。我们在一种名为可分解交替报价协议(DAOP)的新协议中实现了我们的方法。该协议降低了探索代理的效用空间和生成最优投标的成本。因此，分而治之的算法对自动谈判系统的全局性能有积极的影响。
The success of a negotiation depends mainly on the strategies of the negotiators and the problem domain. It is common for negotiators to rely on an agenda to simplify the process and reach better deals. This is particularly true when the negotiators’ preferences are defined over multiple issues. Using an agenda to explore and decompose the interdependencies between the issues is one way to address this problem. This paper applies the classical divide-and-conquer approach to automated negotiations through utility decomposition and bottom-up agenda construction. The approach does not impose an agenda from the top level of the negotiations but builds it bottom-up, given the individual utility functions of the agents and the relationships between the issues. We implemented our method in a novel protocol called the Decomposable Alternating Offers Protocol (DAOP). The protocol reduces the cost of exploring the utility spaces of the agents and the generation of optimal bids. As a result, the divide-and-conquer algorithm positively influences the global performance of an automated negotiation system.