Skip to main content

Egalitarian Allocations of Indivisible Resources: Theory and Computation

  • Conference paper

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

Abstract

We present a mechanism for collaboration and coordination amongst agents in multi-agent societies seeking social equity. This mechanism allows to compute egalitarian allocations of indivisible resources to agents, reached via progressive revisions of social consensus. Egalitarian allocations are allocations with maximal egalitarian social welfare, where the egalitarian social welfare is given by the minimum worth (utility) assigned by agents to the resources they are given by the allocation. Egalitarian allocations are useful in a number of applications of multi-agent systems, e.g. service agents, satellite earth observation and agent oriented/holonic manufacturing systems. The mechanism we propose is distributed amongst the agents, and relies upon an incremental construction whereby agents join progressively in, forcing a revision of the current set of agreements amongst the prior agents. The mechanism uses search trees and a reduction operator simplifying the search for egalitarian allocations. We finally show how to reduce the negotiation time using social order-based coordination mechanisms and make agents find consensus efficiently using well-suited resource-preference orders.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arrow, K.J.: Social Choice and Individual Values. John Wiley and Sons, Chichester (1963)

    Google Scholar 

  2. Sen, A.K.: Collective Choice and Social Welfare. Holden Day (1970)

    Google Scholar 

  3. Moulin, H.: Axioms of Cooperative Decision Making. Cambridge University Press, Cambridge (1988)

    MATH  Google Scholar 

  4. Rawls, J.: A Theory of Justice. Harvard University Press (1971)

    Google Scholar 

  5. Harsanyi, J.C.: Can the Maximin Principle Serve as a Basis for Morality? American Political Science Review 86(2), 269–357 (1996)

    MathSciNet  Google Scholar 

  6. Endriss, U., Maudet, N., Sadri, F., Toni, F.: Resource Allocation in Egalitarian Agent Societies. MFI, pp. 101–110 (2003)

    Google Scholar 

  7. Sandholm, T.: Algorithms for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence 135 (2002)

    Google Scholar 

  8. Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1–2), 165–200 (1998)

    Article  MATH  MathSciNet  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. Dall’Aglio, M., Maccheroni, F.: Fair division without additivity. The American Mathematical Monthly 112 (2005)

    Google Scholar 

  11. Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of EC 2004 (2004)

    Google Scholar 

  12. Golovin, D.: Max-Min Fair Allocations of Indivisible Goods. CMU-CS-05-144 (2005)

    Google Scholar 

  13. Luss, H.: On equitable resource allocation problems: A lexicographic minimax approach. Operations Research 47(3), 361–378 (1999)

    Article  MATH  Google Scholar 

  14. Yu, G.: On the max-min 0-1 knapsack problem with robust optimization applications. Operations Research 44, 407–415 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Brams, S.J., King, D.L.: Efficient Fair Division: Help the Worst Off or Avoid Envy? Rationality and Society 17(4), 387–421 (2005)

    Article  Google Scholar 

  16. Bouveret, S., Lemaître, M., Fargier, H., Lang, J.: Allocation of indivisible goods: a general model and some complexity results. In: AAMAS, pp. 1309–1310 (2005)

    Google Scholar 

  17. Bezakova, I., Dani, V.: Allocating indivisible goods. ACM SIGecom Exchanges 5(3), 11–18 (2005)

    Article  Google Scholar 

  18. Lemaître, M., Verfaillie, G., Bataille, N.: Exploiting a Common Property Resource under a Fairness Constraint: a Case Study. In: IJCAI, pp. 206–211 (1999)

    Google Scholar 

  19. Bussmann, S.: Agent-Oriented Programming of Manufacturing Control Tasks. In: ICMAS, pp. 57–63 (1998)

    Google Scholar 

  20. Bussmann, S., Schild, K.: Self-Organizing Manufacturing Control: An Industrial Application of Agent Technology. In: ICMAS, pp. 87–94 (2000)

    Google Scholar 

  21. Babiceanu, R., Chen, F.: Development and Applications of Holonic Manufacturing Systems: A Survey. Journal of Intelligent Manufacturing 1(17), 111–131 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matt, P.A., Toni, F. (2006). Egalitarian Allocations of Indivisible Resources: Theory and Computation. In: Klusch, M., Rovatsos, M., Payne, T.R. (eds) Cooperative Information Agents X. CIA 2006. Lecture Notes in Computer Science(), vol 4149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839354_18

Download citation

  • DOI: https://doi.org/10.1007/11839354_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38569-1

  • Online ISBN: 978-3-540-38570-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics