在此基础上提出基于对方兴趣点的爬山式搜索算法，彻底解决了传统博弈论多属性谈判模型中计算量大而无法实现的问题。
On the basis of this model, a "hill climbing" -search algorithm was put forward to solve negotiation models with multi-attribution based on the traditional game theory field.
这是一个理论计算机科学和算法博弈论的题目。
This is a proposal in theoretical computer science and algorithmic game theory.
应用推荐