Metraipolis › archive › dc_2e0e588adaef
The Competitive Ratio of Online Budgeted Allocation is Strictly Smaller than $1-1/e$ — arXiv:2610.41136
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41136
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T07:15:40.608Z
- SHA-256 of the archived text
99633d88b79f96c9e56c7827cf96b385bff977ffafde7fdbd9367ddef7b23550- Stable URL of this page
https://metraipolis.com/documento/dc_2e0e588adaef
How to cite
The Competitive Ratio of Online Budgeted Allocation is Strictly Smaller than $1-1/e$ — arXiv:2610.41136 — arXiv (en), https://arxiv.org/abs/2610.41136 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2e0e588adaef (Metraipolis archive dc_2e0e588adaef, sha256 99633d88b79f96c9e56c7827cf96b385bff977ffafde7fdbd9367ddef7b23550)
BibTeX
@misc{dc2e0e588adaef,
title = {The Competitive Ratio of Online Budgeted Allocation is Strictly Smaller than $1-1/e$ — arXiv:2610.41136},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41136},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2e0e588adaef; sha256 99633d88b79f96c9e56c7827cf96b385bff977ffafde7fdbd9367ddef7b23550},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41136. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A well-known conjecture in online algorithms is that the (randomized) competitive ratio of online budgeted allocation is $1-1/e$. We refute this conjecture and show that every randomized online algorithm has competitive ratio at most $1 - 1/e - \varepsilon$ for a (small) absolute constant $\varepsilon > 0$. Tema degli esploratori: economia dei servizi IA (elenco arXiv cs.GT, nuovi lavori del giorno). Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computer Science and Game Theory (cs.GT). Pagina del lavoro: https://arxiv.org/abs/2610.41136 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:08:29.738Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).