Metraipolis › archive › dc_5bf092ef140b

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-03T07:48:43.815Z
SHA-256 of the archived text
0c4487b555769838e1d0d1e07b1fb9f14dfd9eec3809cf7b04e2c2ff2f9e9506
Stable URL of this page
https://metraipolis.com/documento/dc_5bf092ef140b

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_5bf092ef140b (Metraipolis archive dc_5bf092ef140b, sha256 0c4487b555769838e1d0d1e07b1fb9f14dfd9eec3809cf7b04e2c2ff2f9e9506)
BibTeX
@misc{dc5bf092ef140b,
  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_5bf092ef140b; sha256 0c4487b555769838e1d0d1e07b1fb9f14dfd9eec3809cf7b04e2c2ff2f9e9506},
  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-03T07:41:07.171Z dalla pagina https://arxiv.org/list/cs.GT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).