skip to main content
10.1145/952532.952650acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
Article

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

Published: 09 March 2003 Publication History

Abstract

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.

References

[1]
F. Bacchus and A. Grove. Graphical models for preference and utility. In Uncertainty in Artificial Intelligence (UAI-95), pages 3--10. Morgan Kaufmann, 1995.]]
[2]
J. A. Bergstra, A. Ponse, and S. A. Smolka, editors. Handbook of Process Algebra. North Holland, 2001.]]
[3]
M. Dastani, N. Jacobs, C. M. Jonker, and J. Treur. Modelling user preferences and mediating agents in electronic commerce. In Agent Medicated Electronic Commerce, LNAI 1991, pages 163--193. Springer, 2001.]]
[4]
D. de Frutos, M. Núñez, and J. Quemada. Characterizing termination in LOTOS via testing. In Protocol Specification, Testing and Verification XV, pages 237--250. Chapman & Hall, 1995.]]
[5]
T. Eymann. Markets without makers - a framework for decentralized economic coordination in multiagent systems. In WELCOM 2001, LNCS 2232, pages 63--74. Springer, 2001.]]
[6]
R. Guttman, A. Moukas, and P. Maes. Agent-mediated electronic commerce: A survey. The Knowledge Engineering Review, 13(2):147--159, 1998.]]
[7]
S. Kraus. Negotiation and cooperation in multi-agent systems. Artificial Intelligence, 94(1--2):79--98, 1997.]]
[8]
J. Keppens and Q. Shen. A Calculus of Partially Ordered Preferences for Compositional Modelling and Configuration. In AAAI Workshop on Preferences in AI and CP: Symbolic Approaches, pages 39--46. AAAI Press, 2002.]]
[9]
J. Lang, L. van der Torre, and E. Weydert. Utilitarian desires. Autonomous Agents and Multi-Agent Systems, 5(3):329--363, 2002.]]
[10]
A. R. Lomuscio, M. Wooldridge, and N. R. Jennings. A classification scheme for negotiation in electronic commerce. In Agent Mediated Electronic Commerce, LNAI 1991, pages 19--33. Springer, 2001.]]
[11]
N. López and M. Núñez. A testing theory for generally distributed stochastic processes. In CONCUR 2001, LNCS 2154, pages 321--335. Springer, 2001.]]
[12]
N. López, M. Núñez, I. Rodríguez, and F. Rubio. A formal framework for e-barter based on microeconomic theory and process algebras. In Innovative Internet Computer Systems, LNCS 2346, pages 217--228. Springer, 2002.]]
[13]
M. McGeachie and J. Doyle. Utility Functions for Ceteris Paribus Preferences. In AAAI Workshop on Preferences in AI and CP: Symbolic Approaches, pages 33--38. AAAI Press, 2002.]]
[14]
A. Mas-Colell, M. D. Whinston, and J. R. Green. Microeconomic Theory. Oxford University Press, 1995.]]
[15]
R. Milner. Communication and Concurrency. Prentice Hall, 1989.]]
[16]
M. Núñez and I. Rodríguez. PAMR: A process algebra for the management of resources in concurrent systems. In FORTE 2001, pages 169--185. Kluwer Academic Publishers, 2001.]]
[17]
S. Parsons and M. Wooldridge. Game theory and decision theory in multi-agent systems. Autonomous Agents and Multi-Agent Systems, 5(3):243--254, 2002.]]
[18]
L. Rasmusson and S. Janson. Agents, self-interest and electronic markets. The Knowledge Engineering Review, 14(2):143--150, 1999.]]
[19]
T. Sandholm. Agents in electronic commerce: Component technologies for automated negotiation and coalition formation. In CIA'98, LNCS 1435, pages 113--134. Springer, 1998.]]
[20]
W. C. Stirling, M. A. Goodrich, and D. J. Packard. Satisficing equilibria: A non-classical theory of games and decisions. Autonomous Agents and Multi-Agent Systems, 5(3):305--328, 2002.]]
[21]
M. Tennenholtz. Game theory and artificial intelligence. In Foundations and Applications of Multi-Agent Systems, LNAI 2403, pages 49--58. Springer, 2002.]]
[22]
M. Wooldridge and N. R. Jennings. Intelligent agents: Theory and practice. The Knowledge Engineering Review, 10(2):115--152, 1995.]]

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SAC '03: Proceedings of the 2003 ACM symposium on Applied computing
March 2003
1268 pages
ISBN:1581136242
DOI:10.1145/952532
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 March 2003

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. e-commerce
  2. process algebras

Qualifiers

  • Article

Conference

SAC03
Sponsor:
SAC03: ACM Symposium on Applied Computing
March 9 - 12, 2003
Florida, Melbourne

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25
The 40th ACM/SIGAPP Symposium on Applied Computing
March 31 - April 4, 2025
Catania , Italy

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 25 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media