A multi-agent system for e-barter including transaction and shipping costs

An e-barter multi-agent system consists of a set of agents exchanging goods. In contrast to e-commerce systems, transactions do not necessarily involve the exchange of money. Agents are equipped with a utility function to simulate the preferences of the customers that they are representing. They are grouped into local markets, according to the localities of the corresponding customers. Once these markets are saturated (i.e. no more exchanges can be performed) new agents, representing those local markets, are generated and combined into new markets. By reiteratively applying this process we finally get a global market.Even though a formalism to define e-barter architectures has been already introduced, that framework had a strong drawback: Neither transaction nor shipping costs were considered. In this paper we extend that framework to deal with systems where fees have to be paid to the owner of the system. These fees depend on the goods involved in the corresponding exchanges. In addition, shipping costs have also to be paid. These modifications complicate the setting because the utility that customers receive after exchanging goods is not directly given by the original utility function. That is, the returned utility after an exchange is performed has to be computed as a combination of the former utility and the derived costs. In particular, some exchanges may be disallowed because those costs exceed the increase of utility returned by the new basket of goods.

[1]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[2]  Pattie Maes,et al.  Agent-mediated Electronic Commerce : A Survey , 1998 .

[3]  Manuel Núñez,et al.  PAMR: A Process Algebra for the Management of Resources in Concurrent Systems , 2001, FORTE.

[4]  Manuel Núñez,et al.  Characterizing termination in LOTOS via testing , 1995, PSTV.

[5]  Manuel Núñez,et al.  A Formal Framework for E-Barter Based on Microeconomic Theory and Process Algebras , 2002, IICS.

[6]  Jon Doyle,et al.  Utility Functions for Ceteris Paribus Preferences , 2004, Comput. Intell..

[7]  Michael Wooldridge,et al.  Game Theory and Decision Theory in Multi-Agent Systems , 2002, Autonomous Agents and Multi-Agent Systems.

[8]  Fahiem Bacchus,et al.  Graphical models for preference and utility , 1995, UAI.

[9]  Michael Wooldridge,et al.  A Classification Scheme for Negotiation in Electronic Commerce , 2001 .

[10]  Tuomas Sandholm Agents in Electronic Commerce: Component Technologies for Automated Negation and Coalition Formation , 1998, CIA.

[11]  Jon Doyle,et al.  Efficient utility functions for ceteris paribus preferences , 2002, AAAI/IAAI.

[12]  Jeroen Keppens,et al.  A Calculus of Partially Ordered Preferences for Compositional Modelling and Configuration , 2002 .

[13]  Catholijn M. Jonker,et al.  Modeling User Preferences and Mediating Agents in Electronic Commerce , 2001, AgentLink.

[14]  Moshe Tennenholtz,et al.  Game Theory and Artificial Intelligence , 2002, Foundations and Applications of Multi-Agent Systems.

[15]  Leon van der Torre,et al.  Utilitarian Desires , 2002, Autonomous Agents and Multi-Agent Systems.

[16]  Wynn C. Stirling,et al.  Satisficing Equilibria: A Non-Classical Theory of Games and Decisions , 2002, Autonomous Agents and Multi-Agent Systems.

[17]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[18]  Lars Rasmusson,et al.  Agents, self-interest and electronic markets , 1999, The Knowledge Engineering Review.

[19]  Nicholas R. Jennings,et al.  Intelligent agents: theory and practice , 1995, The Knowledge Engineering Review.

[20]  Torsten Eymann Markets without Makers - A Framework for Decentralized Economic Coordination in Multiagent Systems , 2001, WELCOM.

[21]  Ilya Segal,et al.  Solutions manual for Microeconomic theory : Mas-Colell, Whinston and Green , 1997 .

[22]  Sarit Kraus,et al.  Negotiation and Cooperation in Multi-Agent Environments , 1997, Artif. Intell..

[23]  T. Ferguson Game Theory and Decision Theory , 1967 .