The complexity of contract negotiation

被引:45
作者
Dunne, PE [1 ]
Wooldridge, M [1 ]
Laurence, M [1 ]
机构
[1] Univ Liverpool, Dept Comp Sci, Liverpool L69 7ZF, Merseyside, England
基金
英国工程与自然科学研究理事会;
关键词
negotiation; multiagent systems; computational complexity;
D O I
10.1016/j.artint.2005.01.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The use of software agents for automatic contract negotiation in e-commerce and e-trading environments has been the subject of considerable recent interest. A widely studied abstract model considers the setting in which a set of agents have some collection of resources shared out between them and attempt to construct a mutually beneficial optimal reallocation of these by trading resources. The simplest such trades are those in which a single agent transfers exactly one resource to another-so-called 'one-resource-at-a-time' or 'O-contracts'. In this research note we consider the computational complexity of a number of natural decision problems in this setting. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:23 / 46
页数:24
相关论文
共 16 条
[1]   A BOOLEAN FUNCTION REQUIRING 3N NETWORK SIZE [J].
BLUM, N .
THEORETICAL COMPUTER SCIENCE, 1984, 28 (03) :337-345
[2]  
DIGNUM F, 2000, LECT NOTES COMPUT SC, V1916
[3]  
Dunne P., 1988, COMPLEXITY BOOLEAN N
[4]   Extremal behaviour in multiagent contract negotiation [J].
Dunne, PE .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2005, 23 :41-78
[5]   Complexity-theoretic models of phase transitions in search problems [J].
Dunne, PE ;
Gibbons, A ;
Zito, M .
THEORETICAL COMPUTER SCIENCE, 2000, 249 (02) :243-263
[6]  
DUNNE PE, 2004, P ECAI 04 VALC, P1002
[7]  
Endriss U., 2003, P 2 INT JOINT C AUT, P177, DOI DOI 10.1145/860575.860604
[8]  
Kraus Sarit., 2001, INTEL ROB AUTON AGEN
[9]  
McBurney P., 2002, Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems, P402
[10]   BOUNDS TO COMPLEXITIES OF NETWORKS FOR SORTING AND FOR SWITCHING [J].
MULLER, DE ;
PREPARATA, FP .
JOURNAL OF THE ACM, 1975, 22 (02) :195-201