Formal specification of multi-agent e-barter systems

被引:12
作者
Núñez, M [1 ]
Rodríguez, I [1 ]
Rubio, F [1 ]
机构
[1] Univ Complutense Madrid, Fac Informat, Dept Sistemas Informat & Programac, E-28040 Madrid, Spain
关键词
e-barter; formal methods; process algebras; Pareto optimum;
D O I
10.1016/j.scico.2005.01.002
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
An e-barter multi-agent system consists of a set of agents that exchange goods. These agents may perform multilateral exchanges involving several goods. In particular, money can be one of these goods. Each agent is endowed with a utility function indicating the preferences of the respective user. In order to improve the performance, these barter systems are structured in a hierarchical form. Initially agents are grouped, according to localities, into local markets. Once a local market gets completed, that is, no more exchanges are possible, the local market itself becomes a new agent. The preferences of this agent, given by a new utility function, represent the individual preferences of its former customer agents. Then, local markets exchange goods in a higher order market until it gets completed. The process is iterated, in a bottom-up fashion, until the global market embracing all the agents in the system gets completed as well. We provide a formal language, based on classical process algebras, for specifying and analyzing e-barter systems. We also study properties of e-barter systems represented in our notation. In particular, we show that the final distribution of goods in a hierarchical e-barter system is a Pareto optimum. In other words, we will be able to prove that economic efficiency is not lost by considering our hierarchical structure instead of a single market. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:187 / 216
页数:30
相关论文
共 31 条
[1]  
Bacchus F., 1995, Uncertainty in Artificial Intelligence. Proceedings of the Eleventh Conference (1995), P3
[2]  
BAETEN JCM, 1990, CAMBRIDGE TRACTS COM, V18
[3]  
Bergstra J.A., 2001, HDB PROCESS ALGEBRA
[4]  
CAVALLI A, 2004, 19 ACM S APPL COMP S, P795
[5]   The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes [J].
Cheng J.Q. ;
Wellman M.P. .
Computational Economics, 1998, 12 (1) :1-24
[6]  
Doyle J., 2002, AAAI WORKSH PREF AI, P33
[7]  
Eymann T., 2001, LNCS, V2232, P63
[8]   TRANSITION SYSTEM SPECIFICATIONS WITH NEGATIVE PREMISES [J].
GROOTE, JF .
THEORETICAL COMPUTER SCIENCE, 1993, 118 (02) :263-299
[9]   Agent-mediated electronic commerce: a survey [J].
Guttman, RH ;
Moukas, AG ;
Maes, P .
KNOWLEDGE ENGINEERING REVIEW, 1998, 13 (02) :147-159
[10]  
Hoare C., 1985, COMMUNICATING SEQUEN