Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (22): 229-232.DOI: 10.3778/j.issn.1002-8331.2010.22.066

• 工程与应用 • Previous Articles     Next Articles

Method to seek Pareto improvement in multi-Agent system

CHAI Yu-mei,JING Hui-min   

  1. College of Information Engineering,Zhengzhou University,Zhengzhou 450001,China
  • Received:2009-01-13 Revised:2009-03-23 Online:2010-08-01 Published:2010-08-01
  • Contact: CHAI Yu-mei



  1. 郑州大学 信息工程学院,郑州 450001
  • 通讯作者: 柴玉梅

Abstract: The famous Robert Axelrod experiment proves that with good will,tolerant,strong and simple algorithm always is a winner.Based on this thought,PESCO algorithm is designed.It seeks the Pareto efficient solution,achieves the win-win situationas as far as possible,if the opponents are cooperative in the cooperative game.In the non-cooperative game,or opponent is uncooperative,it can be ensured safety in the proceeds.And by the Supplier-Retailers game,Stackelberg game and non-cooperative guessing the coin game,it is carried on gambling the PESCO algorithm with several algorithms,the PESCO algorithm has obtained good results.

Key words: Tit-for-Tat, Q-learning, Pareto efficient solution

摘要: 著名的Robert Axelrod实验证明了具备善意的、宽容的、强硬的和简单明了的算法将总会是赢家。基于这种思想,设计了PESCO算法。它可以在合作博弈中,面对合作的对手,寻求帕累托效率解,尽可能地达到双赢的局面。也可以在非合作博弈中,或对手不合作时,保证安全收益。以可合作的供零博弈、Stackelberg博弈和非合作的猜硬币博弈为背景,将PESCO算法与几个算法进行博弈,PESCO算法取得了较好的效果。

关键词: Tit-for-Tat算法, Q学习, 帕累托效率解

CLC Number: