Persuasive Multi-Agent Multi-Issue Negotiation

Yang Pei; Gao Yang; Chen Zhaoqian

Journal of Computer Research and Development > 2006 > 43(7): 1149-1154.

Yang Pei, Gao Yang, Chen Zhaoqian. Persuasive Multi-Agent Multi-Issue Negotiation[J]. Journal of Computer Research and Development, 2006, 43(7): 1149-1154.

Citation:

Yang Pei, Gao Yang, Chen Zhaoqian. Persuasive Multi-Agent Multi-Issue Negotiation[J]. Journal of Computer Research and Development, 2006, 43(7): 1149-1154.

Citation:

Yang Pei, Gao Yang, Chen Zhaoqian. Persuasive Multi-Agent Multi-Issue Negotiation[J]. Journal of Computer Research and Development, 2006, 43(7): 1149-1154.

PDF (312 KB)

Persuasive Multi-Agent Multi-Issue Negotiation

1(School of Management and Engineering, Nanjing University, Nanjing 210093) 2(National Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093)

More Information

Published Date: July 14, 2006

Graphical Abstract

Abstract

Abstract

The negotiation in MAS is usually comprised of multiple issues, which causes the extremely huge problem space. Classical negotiation methods based on game theory obtain the optimal resolution through thorough search of the space, which are consequently not suitable for multi-issue negotiation. In addition, those methods consider little about the change of the agents' preference, so that with the incomplete and incorrect information, the optimal resolution is not rational. A persuasive multi-agent multi-issue negotiation method is illustrated, which is underpinned by belief revision logic. These belief-based negotiation agents are able to persuade their opponents to change their position. Preliminary experiments show that the belief-based negotiation agents can adapt to the changing environment and reach the agreement more quickly and correctly than those based on the classical negotiation model under time pressure.
- multi-agent system,
- multi-issue negotiation,
- belief revision

FullText(HTML)

References (0)

[1]	Zhang Litian, Kong Jiayi, Fan Yihang, Fan Lingjun, Bao Ergude. Car Accident Prediction Based on Macro and Micro Factors in Probability Level[J]. Journal of Computer Research and Development, 2021, 58(9): 2052-2061. DOI: 10.7544/issn1000-1239.2021.20200345
[2]	Feng Wei, Hang Wenlong, Liang Shuang, Liu Xuejun, Wang Hui. Deep Stack Least Square Classifier with Inter-Layer Model Knowledge Transfer[J]. Journal of Computer Research and Development, 2019, 56(12): 2589-2599. DOI: 10.7544/issn1000-1239.2019.20180741
[3]	Li Qi, Zhong Jiang, Li Xue. DyBGP: A Dynamic-Balanced Algorithm for Graph Partitioning Based on Heuristic Strategies[J]. Journal of Computer Research and Development, 2017, 54(12): 2851-2857. DOI: 10.7544/issn1000-1239.2017.20160690
[4]	Wu Peili, Liu Kui'en, Hao Shengang, Zhang Quanxin, Tan Yu'an. Rapid Traffic Congestion Monitoring Based on Floating Car Data[J]. Journal of Computer Research and Development, 2014, 51(1): 189-198.
[5]	Fang Min, Niu Wenke, Zhang Xiaosong. Multiple Attractor Cellular Automata Classification Method and Over-Fitting Problem with CART[J]. Journal of Computer Research and Development, 2012, 49(8): 1747-1752.
[6]	Li Xiongfei, Li Jun, Qu Chengwei, Liu Lijuan, Sun Tao. Balancing Method for Skewed Training Set in Data Mining[J]. Journal of Computer Research and Development, 2012, 49(2): 346-353.
[7]	Zhao Huan, Wang Gangjin, Hu Lian, and Peng Xiujuan. Voice Activity Detection Based on Sample Entropy in Car Environments[J]. Journal of Computer Research and Development, 2011, 48(3): 471-476.
[8]	Wu Jiawei, Li Xiongfei, Sun Tao, and Li Wei. A Density-Based Clustering Algorithm Concerning Neighborhood Balance[J]. Journal of Computer Research and Development, 2010, 47(6): 1044-1052.
[9]	Yang Xiaowei, Lu Jie, Zhang Guangquan. An Effective Pruning Algorithm for Least Squares Support Vector Machine Classifier[J]. Journal of Computer Research and Development, 2007, 44(7): 1128-1136.
[10]	Zhou Minghua, Wang Guozhao. Genetic Algorithm-Based Least Square Fitting of B-Spline and Bézier Curves[J]. Journal of Computer Research and Development, 2005, 42(1): 134-143.