首页> 外文会议>IEEE International Conference on Service-Oriented Computing and Applications >TKI Adaptation Strategy for Complex Multi-times Bilateral Negotiations
【24h】

TKI Adaptation Strategy for Complex Multi-times Bilateral Negotiations

机译:复杂的多次双边谈判的TKI适应策略

获取原文

摘要

Bilateral multi-issue closed negotiation is an important class for real-life negotiations. Usually, negotiation problems have constraints such as a complex and unknown opponent's utility in real time, or time discounting. Recently, the attention of this study has focused on the nonlinear utility functions. In nonlinear utility functions, most of the negotiation strategies for linear utility functions can't adopt to the scenarios of nonlinear utility functions. In this paper, we propose an automated agent that estimates the opponent's strategies based on the past negotiation sessions. Our agent tries to compromise to the estimated maximum utility of the opponent by the end of the negotiation. In addition, our agent can adjust the speed of compromise by judging the opponent's Thomas-Kilmann Conflict Mode and search for the pare to frontier using past negotiation sessions. In the experiments, we demonstrate that the proposed agent has better outcomes and greater search technique than existing agents.
机译:双边多问题的封闭式谈判是现实生活中谈判的重要一类。通常,谈判问题具有约束条件,例如实时的复杂而未知的对手效用或时间折扣。最近,这项研究的注意力集中在非线性效用函数上。在非线性效用函数中,大多数线性效用函数的协商策略都不能采用非线性效用函数的方案。在本文中,我们提出了一种自动代理程序,该代理程序可以根据过去的协商会话来估计对手的策略。我们的经纪人会努力在谈判结束前折衷对手的最大估计效用。此外,我们的特工可以通过判断对手的托马斯·基尔曼冲突模式并使用过去的协商会议来寻找对边边界的方式来调整妥协的速度。在实验中,我们证明了所提出的代理比现有代理具有更好的结果和更好的搜索技术。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号