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...
Tallennettuna:
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | bachelorThesis |
| Kieli: | eng |
| Julkaistu: |
2025
|
| Aiheet: | |
| Linkit: | http://repositorio.yachaytech.edu.ec/handle/123456789/971 |
| Tagit: |
Lisää tagi
Ei tageja, Lisää ensimmäinen tagi!
|