【24h】

A win–win method for multi-party negotiation support

机译:多方协商支持的双赢方法

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we introduce an interactive multi-party negotiation support method for decision problems that involve multiple, conflicting linear criteria and linear constraints. Most previous methods for this type of problem have relied on decision alternatives located on the Pareto frontier; in other words, during the negotiation process the parties are presented with new Pareto optimal solutions, requiring the parties to sacrifice the achievement of some criteria in order to secure improvements with respect to other criteria. Such a process may be vulnerable to stalemate situations where none of the parties is willing to move to a potentially better solution, e.g., because they perceive – rightly or wrongly ? that they have to give up more than their fair share. Our method relies on "win–win" scenarios in which each party will be presented with "better" solutions at each stage of the negotiations. Each party starts the negotiation process at some inferior initial solution, for instance the best starting point that can be achieved without negotiation with the other parties, such as BATNA (best alternative to a negotiated agreement). In subsequent iterations, the process gravitates closer to the Pareto frontier by suggesting an improved solution to each party, based on the preference information (e.g., aspiration levels) provided by all parties at the previous iteration. The preference information that each party needs to provide is limited to aspiration levels for the objectives, and a party's revealed preference information is not shared with the opposing parties. Therefore, our method may represent a more natural negotiation environment than previous methods that rely on tradeoffs and sacrifice, and provides a positive decision support framework in which each party may be more comfortable with, and more readily accept, the proposed compromise solution. The current paper focuses on the concept, the algorithmic development, and uses an example to illustrate the nature and capabilities of our method. In a subsequent paper, we will use experiments with real users to explore issues such as whether our proposed "win–win" method tends to result in better decisions or just better negotiations, or both; and how users will react in practice to using an inferior starting point in the negotiations.
机译:在本文中,我们针对涉及多个冲突线性准则和线性约束的决策问题介绍了一种交互式的多方协商支持方法。解决此类问题的大多数先前方法都依赖于位于Pareto前沿的决策选择。换句话说,在谈判过程中,为当事方提供了新的帕累托最优解决方案,要求当事方牺牲某些标准的实现以确保相对于其他标准的改进。这样的过程可能容易陷入僵局,在这种僵局下,任何一方都不愿意采取可能更好的解决方案,例如,因为他们认为对与错?他们必须放弃比公平份额更多的东西。我们的方法依赖于“双赢”方案,在这种方案中,将在谈判的每个阶段为各方提供“更好”的解决方案。各方以某种次等的初始解决方案开始谈判过程,例如,无需与其他方进行谈判就可以实现的最佳起点,例如BATNA(谈判协议的最佳替代方案)。在随后的迭代中,该过程通过基于在先前迭代中所有各方提供的偏好信息(例如,期望水平)向各方提出改进的解决方案,而更接近帕累托边界。各方需要提供的偏好信息仅限于目标的期望水平,并且一​​方与对方共享的透露的偏好信息不会被共享。因此,与以前的基于权衡和牺牲的方法相比,我们的方法可能代表了一个更自然的谈判环境,并且提供了一个积极的决策支持框架,在该框架中,各方都可以更轻松地接受提议的折衷解决方案。本文主要关注概念,算法开发,并通过一个例子来说明我们方法的性质和功能。在随后的论文中,我们将通过对真实用户的实验来探索问题,例如我们提出的“双赢”方法是倾向于做出更好的决策还是仅仅进行更好的谈判,或者两者兼而有之;以及用户在实践中如何对在谈判中使用劣等起点做出反应。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号