earticle

논문검색

Dynamic Coalition Formation Based on Multi-sided Negotiation

초록

영어

The coalition formation is an important aspect of multi-agent negotiation and cooperation. Based on the Bilateral Shapley-Value, a multi-sided eigenvalue is presented by using the reference of n-person stochastic cooperative game. It is obvious when multi-sided eigenvalue have superadditivity, rational agents will combine to one coalition. A dynamic coalition formation algorithm is constructed based on the eigenvalue. Procedures of multi-sided negotiation, agent’s negotiation and coalition condensing are introduced in detail. In the end, the complexity, validity, coalition stability and parameter’s function of the algorithm is given. According to these, the correctness of the algorithm is proven.

목차

Abstract
 1. Introduction
 2. Basic Definitions
 3. Coalition Formation Algorithm based on Multi-Sided Negotiation
 4. Analyses of the Algorithm
 5. Experiment
 6. Conclusion
 References

저자정보

  • Lin Xiang College of Information Engineering, China Jiliang University, Hangzhou, Zhejiang, China
  • Haijun Tao College of Information Engineering, China Jiliang University, Hangzhou, Zhejiang, China

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.