Method to seek Pareto improvement in multi-Agent system

doi:10.3778/j.issn.1002-8331.2010.22.066

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

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

一种在多Agent系统中求帕累托效率解的方法

柴玉梅，景慧敏

郑州大学信息工程学院，郑州 450001

通讯作者: 柴玉梅

Abstract

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:

TP311

CHAI Yu-mei，JING Hui-min. Method to seek Pareto improvement in multi-Agent system[J]. Computer Engineering and Applications, 2010, 46(22): 229-232.

柴玉梅，景慧敏. 一种在多Agent系统中求帕累托效率解的方法[J]. 计算机工程与应用, 2010, 46(22): 229-232.

[1]	ZHANG Junjie, ZHANG Cong, ZHAO Hanjie. Dueling Deep Q Network Algorithm with State Value Reuse [J]. Computer Engineering and Applications, 2021, 57(4): 134-140.
[2]	HAN Daoqi, ZHANG Junyao, ZHOU Yuhang, LIU Qing. Research on Intelligent Trader Model Based on Deep Reinforcement Learning [J]. Computer Engineering and Applications, 2020, 56(21): 145-153.
[3]	WANG Mengjiao, YIN Xiang, HUANG Ningxin. Multitask Assignment Algorithm Based on Transfer Learning [J]. Computer Engineering and Applications, 2020, 56(13): 150-155.
[4]	CHEN Xiaoqian, LIU Ruixiang. Route Planning Method Based on Least-Squares Policy Iteration for Unmanned Aerial Vehicle [J]. Computer Engineering and Applications, 2020, 56(1): 191-195.
[5]	HU Lingyao1，2，3, CHEN Jianping1，2，3, FU Qiming1，2，3，4, HU Wen1，2，3, NI Qingwen1，2，3. Building energy efficiency oriented reinforcement learning adaptive control method [J]. Computer Engineering and Applications, 2017, 53(21): 239-246.
[6]	LIU Xiaowei1, GAO Chunming2. Optimization of agent behavior decision in UT2004 combined with behavior tree and Q-learning algorithm [J]. Computer Engineering and Applications, 2016, 52(3): 113-118.
[7]	ZHANG Xiaofang1, XIE Jun2. Research on optimization model and power strategy of controllable household appliances’ loads [J]. Computer Engineering and Applications, 2016, 52(24): 246-250.
[8]	GE Jun1, ZHOU Lianying2. Two-layer hierarchical control solutions for traffic signal [J]. Computer Engineering and Applications, 2015, 51(20): 246-252.
[9]	ZHAO Fajun, LI Longshu. RoboCup regional cooperative strategy based on multi-Agent Q-learning [J]. Computer Engineering and Applications, 2014, 50(23): 127-130.
[10]	SHENG Xinyi1, SUN Jun2, ZHOU Di1, XU Wenbo2. Quantum-behaved particle swarm optimization method based on Q-learning [J]. Computer Engineering and Applications, 2014, 50(21): 8-13.
[11]	ZHANG Huilong, LI Longshu. Application of Q-Learning in local attacking decision [J]. Computer Engineering and Applications, 2013, 49(7): 240-242.
[12]	LIU Zhiyong1，2，SONG Zhengdong2. Chaotic fuzzy Q-learning control for urban area traffic signals [J]. Computer Engineering and Applications, 2012, 48(4): 207-210.
[13]	WANG Haizhen1, LIAN Zuozheng2, TENG Yanping1. Research on multi-Agent fuzzy Q-learning in intelligent office environment [J]. Computer Engineering and Applications, 2012, 48(18): 231-235.
[14]	LIU Zhibin1，ZHU Xiaolong2，CAO Baoxiang1. Method of adaptive programming [J]. Computer Engineering and Applications, 2011, 47(36): 80-82.
[15]	CHANG Xiaojun. RoboCup-2D passing strategy based on joint reinforcement learning [J]. Computer Engineering and Applications, 2011, 47(23): 212-216.

Method to seek Pareto improvement in multi-Agent system

一种在多Agent系统中求帕累托效率解的方法

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics