Lower Bound for Online MMS Assignment of Indivisible Chores
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866913945905790976 |
|---|---|
| author | Seddighin, Masoud Seddighin, Saeed |
| author_facet | Seddighin, Masoud Seddighin, Saeed |
| contents | We consider the problem of online assignment of indivisible chores under \MMS\ criteria. The previous work proves that any deterministic online algorithm for chore division has a competitive ratio of at least 2. In this work, we improve this bound by showing that no deterministic online algorithm can obtain a competitive ratio better than $n$ for $n$ agents. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_12984 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Lower Bound for Online MMS Assignment of Indivisible Chores Seddighin, Masoud Seddighin, Saeed Computer Science and Game Theory We consider the problem of online assignment of indivisible chores under \MMS\ criteria. The previous work proves that any deterministic online algorithm for chore division has a competitive ratio of at least 2. In this work, we improve this bound by showing that no deterministic online algorithm can obtain a competitive ratio better than $n$ for $n$ agents. |
| title | Lower Bound for Online MMS Assignment of Indivisible Chores |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2507.12984 |