摘要
在众多的自动谈判模式中,协同谈判是一种新型的多线程谈判形式。文章分析了面向电子商务的协同谈判中的冲突问题,提出了解决谈判冲突的方法——满意度函数法。该方法在谈判模型中用约束网来表示谈判中的变量和约束关系,通过约束放松来解决谈判中的冲突。作者在对约束及约束网进行详细分析的基础上设计了约束传播算法,用它来求解约束网问题。文章通过实例验证了提出的论点和方法的正确性。采用这种基于约束放松的协同谈判模型可以有效地解决谈判中的冲突,提高谈判的效率。该方法的应用可为解决多个谈判的组合问题提供一种新的思路。
Among various automated negotiation modes, the collaborative negotiation is a new form of muhithread negotiation. This method uses constraint net to express variable and constraint relationship of negotiation in negotiation model. On the basis of analyzing constraint and constraint web in detail, we design the method based on the domain propagation of constraints used to resolve the constraint web problem, which makes the collaborative negotiation model based on relaxative constraints to resolve conflict on negotiation effectively and improve negotiation efficiency. The experimental result validates the method proposed in this paper. The application of this approach will offer a new conception of solving the combination of several negotiations.
出处
《运筹与管理》
CSCD
2008年第4期132-137,共6页
Operations Research and Management Science
基金
国家自然科学基金资助项目(No.70601008)
关键词
协同谈判模型
约束网
约束传播
collaborative negotiation model
constraint net
domain propagation of constraints
