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...
Saved in:
| Main Author: | |
|---|---|
| Format: | bachelorThesis |
| Language: | eng |
| Published: |
2025
|
| Subjects: | |
| Online Access: | http://repositorio.yachaytech.edu.ec/handle/123456789/971 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Add Tag Be the first to leave a comment!