Skip to main content

A Multi-Agent Resource Negotiation for the Utilitarian Welfare

  • Conference paper
Engineering Societies in the Agents World IX (ESAW 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5485))

Included in the following conference series:

Abstract

The multi-agent resource allocation problem is the negotiation of m resources among the n agents of a population, in order to maximize a social welfare function. Contrary to some former studies, the purpose is here neither to simply determine a socially optimal resource allocation nor to prove the existence of a transaction sequence leading to this optimum. The objective is to define the individual behavior of the agents which leads to an optimal resource allocation as an emergent phenomenon, based on any kind of contact network and on any utility value. With this intention, we study various agent behaviors in order to identify which one leads to an optimal resource allocation.

After a study of different transaction types, we show that, among the set of studied transactions, the so called “social gift” transaction, is the most efficient one for solving the utilitarian resource allocation problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Barabási, A.L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74(1), 47–97 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Arrow, K.J.: Social Choice and Individual Values. Yale University Press (1963)

    Google Scholar 

  3. Arrow, K.J., Sen, A.K., Suzumura, K.: Handbook of Social Choice and Welfare. Elsevier, Amsterdam (2002)

    MATH  Google Scholar 

  4. Bellosta, M.-J., Kornman, S., Vanderpooten, D.: An agent-based mechanism for autonomous multiple criteria auctions. In: IAT 2006, China, Hong-Kong, December 2006, pp. 587–594 (2006)

    Google Scholar 

  5. Bouveret, S., Lang, J.: Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. In: IJCAI 2005, UK, Scotland, Edinburgh, July 2005, pp. 935–940 (2005)

    Google Scholar 

  6. Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Multiagent resource allocation with k-additive utility functions. In: Proc. DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, Annales du LAMSADE, vol. 3, pp. 83–100 (2004)

    Google Scholar 

  7. Chevaleyre, Y., Endriss, U., Estivie, S., Maudet, N.: Reaching envy-free states in distributed negotiation settings. In: IJCAI 2007, India, Hyderabad, January 6-12, 2007, pp. 1239–1244. AAAI Press, Menlo Park (2007)

    Google Scholar 

  8. Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: Negotiating over small bundles of resources. In: AAMAS 2005, EU, The Netherlands, Utrecht, July 25-29, 2005, pp. 296–302. ACM Press, New York (2005)

    Google Scholar 

  9. Endriss, U., Maudet, N., Sadri, F., Toni, F.: Negotiating socially optimal allocations of resources. Journal of Artificial Intelligence Research 25, 315–348 (2006)

    MathSciNet  Google Scholar 

  10. Estivie, S., Chevaleyre, Y., Endriss, U., Maudet, N.: How equitable is rational negotiation? In: AAMAS 2006, Japan, Hakodate, May 8-12, 2006, pp. 866–873. ACM Press, New York (2006)

    Google Scholar 

  11. Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. Theory of Computing Systems 42(1), 91–130 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Miranda, P., Grabisch, M., Gil, P.: Axiomatic structure of k-additive capacities. Mathematical Social Sciences 49, 153–178 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  13. Moulin, H.: Axioms of cooperative decision making. Cambridge University Press, Cambridge (1988)

    Book  MATH  Google Scholar 

  14. Sandholm, T.W.: Contract types for satisficing task allocation: I theoretical results. In: AAAI Spring Symposium: Satisficing Models, USA, California, Stanford University, March 23-25 (1998)

    Google Scholar 

  15. Sandholm, T.W.: eMediator: A Next Generation Electronic Commerce Server. Computational Intelligence 18(4), 656–676 (2002)

    Article  MathSciNet  Google Scholar 

  16. Shneidman, J., Parkes, D.C.: Rationality and Self-Interest in Peer to Peer Networks. LNCS pp. 139–148 (2003)

    Google Scholar 

  17. Travers, J., Milgram, S.: An experimental study of the small world problem. Sociometry 32(4), 425–443 (1969)

    Article  Google Scholar 

  18. Wellman, M.P., Doyle, J.: Modular Utility Representation for Decision-Theoretic Planning. In: AIPS 1992 - Artificial Intelligence Planning Systems, USA, Maryland, College Park, June 15-17, 1992, pp. 236–242. Morgan Kaufmann, San Francisco (1992)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nongaillard, A., Mathieu, P., Jaumard, B. (2009). A Multi-Agent Resource Negotiation for the Utilitarian Welfare. In: Artikis, A., Picard, G., Vercouter, L. (eds) Engineering Societies in the Agents World IX. ESAW 2008. Lecture Notes in Computer Science(), vol 5485. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02562-4_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02562-4_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02561-7

  • Online ISBN: 978-3-642-02562-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics