A review of some fair allocation algorithms for indivisible items

This work reviews some fair and efficient algorithms in the allocation problem of indivisible items in the general additive and g-binary additive instances for the cases of goods, chores, and mixtures of goods and chores. Firstly, the state of the art is studied to comprehend the fundamental concept...

• מחבר ראשי: Chipantasig Chipantashi, Jefferson Javier (author)
• פורמט: bachelorThesis
• שפה: eng
• יצא לאור: 2025
• נושאים: Algoritmos; Elementos indivisibles; Bienestar social; Algorithms; Indivisible items; Social welfare
• גישה מקוונת: http://repositorio.yachaytech.edu.ec/handle/123456789/971