Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1082473.1082747acmconferencesArticle/Chapter ViewAbstractPublication PagesaamasConference Proceedingsconference-collections
Article

Allocation of indivisible goods: a general model and some complexity results

Published: 25 July 2005 Publication History

Abstract

Many industrial or research activities are so expensive that it is often benefitable for the involved agents to cofund the construction or the purchase of a common required resource. This resource will then be exploited in common, therefore in a shared way. The rules for resource sharing should take account of the possibly antagonistic preferences: each agent wants to maximize its own satisfaction, whereas, from the collective point of view, decisions which both are equitable and exploit the resource in an optimal way are looked for. We give in this article a formal model for indivisible goods resource sharing without monetary compensations and with arbitrary feasability constraints. We also give some complexity results about this model. The model is applied to a real-world case, namely satellite resource sharing.

References

[1]
S. Bouveret and J. Lang. Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity. In Proc. of IJCAI05.
[2]
J. Lang. Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence, 42:37--71, 2004.
[3]
M. Lemaître, G. Verfaillie, and N. Bataille. Exploiting a Common Property Resource under a Fairness Constraint: a Case Study. In Proc. of IJCAI-99, pages 206--211, Stockholm, Sweden, 1999.
[4]
R. Lipton, E. Markakis, E. Mossel, and A. Saberi. On approximately fair allocations of indivisible goods. In Proceedings of EC'04, 2004.
[5]
H. Moulin. Fair division and collective welfare. MIT Press, 2003.
[6]
N. Nisan. Combinatorial auctions, chapter Bidding languages. 2005.
[7]
Y. S. Peter Cramton and R. Steinberg, editors. Combinatorial Auctions. MIT Press, 2006. forthcoming.

Cited By

View all
  • (2021)Worst-case Bounds for Spending a Common BudgetProceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3463952.3463991(288-296)Online publication date: 3-May-2021
  • (2020)Preference-based resource reservation method for resource allocation in full distributed systemsMultiagent and Grid Systems10.3233/MGS-19031715:4(359-374)Online publication date: 10-Feb-2020
  • (2020)Collective Decision MakingA Guided Tour of Artificial Intelligence Research10.1007/978-3-030-06164-7_18(587-627)Online publication date: 8-May-2020
  • Show More Cited By

Index Terms

  1. Allocation of indivisible goods: a general model and some complexity results

      Recommendations

      Comments

      Please enable JavaScript to view thecomments powered by Disqus.

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
      July 2005
      1407 pages
      ISBN:1595930930
      DOI:10.1145/1082473
      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: 25 July 2005

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. computational compexity
      2. fair allocation
      3. logic
      4. preference aggregation
      5. resource sharing

      Qualifiers

      • Article

      Conference

      AAMAS05
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 28 Sep 2024

      Other Metrics

      Citations

      Cited By

      View all
      • (2021)Worst-case Bounds for Spending a Common BudgetProceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3463952.3463991(288-296)Online publication date: 3-May-2021
      • (2020)Preference-based resource reservation method for resource allocation in full distributed systemsMultiagent and Grid Systems10.3233/MGS-19031715:4(359-374)Online publication date: 10-Feb-2020
      • (2020)Collective Decision MakingA Guided Tour of Artificial Intelligence Research10.1007/978-3-030-06164-7_18(587-627)Online publication date: 8-May-2020
      • (2019)The price to pay for forgoing normalization in fair division of indivisible goodsAnnals of Mathematics and Artificial Intelligence10.1007/s10472-019-09659-1Online publication date: 16-Aug-2019
      • (2019)The Fair OWA One-to-One Assignment ProblemAlgorithmica10.1007/s00453-018-0434-581:1(98-123)Online publication date: 1-Jan-2019
      • (2018)Fair Resource Allocation Over TimeProceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems10.5555/3237383.3237496(766-773)Online publication date: 9-Jul-2018
      • (2014)On regular and approximately fair allocations of indivisible goodsProceedings of the 2014 international conference on Autonomous agents and multi-agent systems10.5555/2615731.2617405(997-1004)Online publication date: 5-May-2014
      • (2013)Decomposing combinatorial auctions and set packing problemsJournal of the ACM10.1145/2508028.250598760:4(1-39)Online publication date: 4-Sep-2013
      • (2010)LP Solvable Models for Multiagent Fair Allocation ProblemsProceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence10.5555/1860967.1861045(393-398)Online publication date: 4-Aug-2010
      • (2010)A general branch-and-bound algorithm for fair division problemsComputers and Operations Research10.1016/j.cor.2010.03.00137:12(2121-2130)Online publication date: 1-Dec-2010
      • Show More Cited By

      View Options

      Get Access

      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