Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki Sirius Huang -- 3265 2022-11-28 01:38:18

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
No, upload directly Yes
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
HandWiki. Fair Item Assignment. Encyclopedia. Available online: https://encyclopedia.pub/entry/36840 (accessed on 21 September 2026).
HandWiki. Fair Item Assignment. Encyclopedia. Available at: https://encyclopedia.pub/entry/36840. Accessed September 21, 2026.
HandWiki. "Fair Item Assignment" Encyclopedia, https://encyclopedia.pub/entry/36840 (accessed September 21, 2026).
HandWiki. (2022, November 28). Fair Item Assignment. In Encyclopedia. https://encyclopedia.pub/entry/36840
HandWiki. "Fair Item Assignment." Encyclopedia. Web. 28 November, 2022.
Fair Item Assignment
Edit
The content is sourced from: https://handwiki.org/wiki/Social:Fair_item_assignment

Fair item assignment is a kind of a fair division problem in which the items to divide are indivisible. The items have to be divided among several partners who value them differently, and each item has to be given as a whole to a single person. This situation arises in various real-life scenarios: The indivisibility of the items implies that a fair division may not be possible. As an extreme example, if there is only a single item (e.g. a house), it must be given to a single partner, but this is not fair to the other partners. This is in contrast to the fair cake-cutting problem, where the dividend is divisible and a fair division always exists. In some cases, the indivisibility problem can be mitigated by introducing monetary payments or time-based rotation, or by discarding some of the items.:285 But such solutions are not always available. An item assignment problem has several ingredients: These ingredients are explained in detail below.

item assignment fair division indivisibility

References

  1. Barberà, S., Bossert, W., & Pattanaik, P. K. (2004). "Ranking sets of objects.". Handbook of utility theory. Springer US.. https://papyrus.bib.umontreal.ca/xmlui/bitstream/handle/1866/343/2001-02.pdf?sequence=1. 
  2. Sylvain Bouveret; Ulle Endriss; Jérôme Lang (2010). "Fair Division Under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods". Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence. http://dl.acm.org/citation.cfm?id=1861044. Retrieved 26 August 2016. 
  3. Brams, Steven J.; Edelman, Paul H.; Fishburn, Peter C. (2003). "Fair Division of Indivisible Items". Theory and Decision 55 (2): 147. doi:10.1023/B:THEO.0000024421.85722.0a.  https://dx.doi.org/10.1023%2FB%3ATHEO.0000024421.85722.0a
  4. Brams, S. J. (2005). "Efficient Fair Division: Help the Worst off or Avoid Envy?". Rationality and Society 17 (4): 387. doi:10.1177/1043463105058317.  https://dx.doi.org/10.1177%2F1043463105058317
  5. Sylvain Bouveret and Yann Chevaleyre and Nicolas Maudet, "Fair Allocation of Indivisible Goods". Chapter 12 in: Brandt, Felix; Conitzer, Vincent; Endriss, Ulle; Lang, Jérôme; Procaccia, Ariel D. (2016) (in en). Handbook of Computational Social Choice. Cambridge University Press. ISBN 9781107060432. https://books.google.com/books?id=nMHgCwAAQBAJ.  (free online version)
  6. Bouveret, Sylvain; Lemaître, Michel (2015). "Characterizing conflicts in fair division of indivisible goods using a scale of criteria". Autonomous Agents and Multi-Agent Systems 30 (2): 259. doi:10.1007/s10458-015-9287-3.  https://dx.doi.org/10.1007%2Fs10458-015-9287-3
  7. Budish, E. (2011). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal of Political Economy 119 (6): 1061. doi:10.1086/664613.  https://dx.doi.org/10.1086%2F664613
  8. Heinen, Tobias; Nguyen, Nhan-Tam; Rothe, Jörg (2015). "Algorithmic Decision Theory". 9346. pp. 521. doi:10.1007/978-3-319-23114-3_31. ISBN 978-3-319-23113-6.  https://dx.doi.org/10.1007%2F978-3-319-23114-3_31
  9. Caragiannis, Ioannis; Kurokawa, David; Moulin, Hervé; Procaccia, Ariel D.; Shah, Nisarg; Wang, Junxing (2016). "The Unreasonable Fairness of Maximum Nash Welfare". Proceedings of the 2016 ACM Conference on Economics and Computation - EC '16. pp. 305. doi:10.1145/2940716.2940726. ISBN 9781450339360.  https://dx.doi.org/10.1145%2F2940716.2940726
  10. Procaccia, Ariel D.; Wang, Junxing (2014). "Fair enough: guaranteeing approximate maximin shares". EC '14 Proceedings of the fifteenth ACM conference on Economics and computation: 675–692. doi:10.1145/2600057.2602835. ISBN 9781450325653.  https://dx.doi.org/10.1145%2F2600057.2602835
  11. http://www.spliddit.org/apps/goods
  12. Aziz, Haris; Gaspers, Serge; MacKenzie, Simon; Walsh, Toby (2015). "Fair assignment of indivisible objects under ordinal preferences". Artificial Intelligence 227: 71. doi:10.1016/j.artint.2015.06.002.  https://dx.doi.org/10.1016%2Fj.artint.2015.06.002
  13. Pruhs, Kirk; Woeginger, Gerhard J. (2012). "Fun with Algorithms". 7288. pp. 305. doi:10.1007/978-3-642-30347-0_30. ISBN 978-3-642-30346-3.  https://dx.doi.org/10.1007%2F978-3-642-30347-0_30
  14. Demange, Gabrielle; Gale, David; Sotomayor, Marilda (1986). "Multi-Item Auctions". Ournal of Political Economy 94: 863–872. 
  15. Mu'alem, Ahuva (2014). "Fair by design: Multidimensional envy-free mechanisms". Games and Economic Behavior 88: 29–46. doi:10.1016/j.geb.2014.08.001.  https://dx.doi.org/10.1016%2Fj.geb.2014.08.001
  16. Ruggiero Cavallo (2012). "Fairness and Welfare Through Redistribution When Utility is Transferable". AAAI-12. http://www.eecs.harvard.edu/~cavallo/papers/cavallo-aaai12.pdf. 
  17. Bailey, Martin J. (1997). Public Choice 91 (2): 107. doi:10.1023/A:1017949922773.  https://dx.doi.org/10.1023%2FA%3A1017949922773
  18. Cavallo, Ruggiero (2006). "Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems - AAMAS '06". pp. 882. doi:10.1145/1160633.1160790. ISBN 1595933034.  https://dx.doi.org/10.1145%2F1160633.1160790
  19. Golovin, Daniel (2005). "Max-min fair allocation of indivisible goods". CMU. http://repository.cmu.edu/compsci/2348/. Retrieved 27 August 2016. 
  20. Nguyen, Trung Thanh; Roos, Magnus; Rothe, Jörg (2013). "A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation". Annals of Mathematics and Artificial Intelligence 68: 65. doi:10.1007/s10472-012-9328-4.  https://dx.doi.org/10.1007%2Fs10472-012-9328-4
  21. Nguyen, Nhan-Tam; Nguyen, Trung Thanh; Roos, Magnus; Rothe, Jörg (2013). "Computational complexity and approximability of social welfare optimization in multiagent resource allocation". Autonomous Agents and Multi-Agent Systems 28 (2): 256. doi:10.1007/s10458-013-9224-2.  https://dx.doi.org/10.1007%2Fs10458-013-9224-2
  22. Bansal, Nikhil; Sviridenko, Maxim (2006). "Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06". pp. 31. doi:10.1145/1132516.1132522. ISBN 1595931341.  https://dx.doi.org/10.1145%2F1132516.1132522
  23. Bezáková, Ivona; Dani, Varsha (2005). "Allocating indivisible goods". ACM SIGecom Exchanges 5 (3): 11. doi:10.1145/1120680.1120683.  https://dx.doi.org/10.1145%2F1120680.1120683
  24. Asadpour, Arash; Saberi, Amin (2010). "An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods". SIAM Journal on Computing 39 (7): 2970. doi:10.1137/080723491.  https://dx.doi.org/10.1137%2F080723491
  25. Dall'Aglio, Marco; Mosca, Raffaele (2007). "How to allocate hard candies fairly". Mathematical Social Sciences 54 (3): 218. doi:10.1016/j.mathsocsci.2007.04.008.  https://dx.doi.org/10.1016%2Fj.mathsocsci.2007.04.008
  26. Trung Thanh Nguyen and Jörg Rothe (2013). "Envy-ratio and average-nash social welfare optimization in multiagent resource allocation". AAMAS 13. 
  27. Brams, Steven J.; Kaplan, Todd R. (2004). "Dividing the Indivisible". Journal of Theoretical Politics 16 (2): 143. doi:10.1177/0951629804041118.  https://dx.doi.org/10.1177%2F0951629804041118
  28. Herreiner, Dorothea; Puppe, Clemens. "Distributing Indivisible Goods Fairly: Evidence from a Questionnaire Study". Loyola Marimount University - Economics Faculty Works. http://digitalcommons.lmu.edu/econ_fac/3/. 
  29. Herreiner, Dorothea K.; Puppe, Clemens (November 2010). "Inequality aversion and efficiency with ordinal and cardinal social preferences—An experimental study". Journal of Economic Behavior & Organization 76 (2): 238–253. doi:10.1016/j.jebo.2010.06.002.  https://dx.doi.org/10.1016%2Fj.jebo.2010.06.002
  30. Herreiner, Dorothea K.; Puppe, Clemens D. (2007). "Envy Freeness in Experimental Fair Division Problems". Theory and Decision 67: 65. doi:10.1007/s11238-007-9069-8.  https://dx.doi.org/10.1007%2Fs11238-007-9069-8
More
©Text is available under the terms and conditions of the Creative Commons-Attribution ShareAlike (CC BY-SA) license; additional terms may apply. By using this site, you agree to the Terms and Conditions and Privacy Policy.
Upload a video for this entry
Information
Subjects: Others
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
HandWiki
View Times: 1.1K
Entry Collection: HandWiki
Revision: 1 time (View History)
Update Date: 28 Nov 2022
Table of Contents
    Notice
    You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
    OK
    Confirm
    Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
    Yes
    No
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    There is no comment~
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    ${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
    Submit
    Cancel
    Confirm
    Are you sure to Delete?
    Yes No
    Academic Video Service
    Feedback