method · first seen 13 Oct 2026
greedy approximation algorithm
Polynomial-time algorithm that makes locally optimal choices at each step, with provable approximation guarantees for NP-hard optimization problems.
Mentions per week
PapersCodeDiscussion
Earliest sources
- Approximating Optimal Policies in Heterogeneous Asynchronous Multi-player BanditsPapers · 13 Oct 2026 · Sacha Arroues-Paykin, Etienne Boursier, Vianney Perchet
Latest sources
- Approximating Optimal Policies in Heterogeneous Asynchronous Multi-player BanditsPapers · 13 Oct 2026 · Sacha Arroues-Paykin, Etienne Boursier, Vianney Perchet