The paper introduces a novel approach to Single-Sample Prophet Inequalities (SSPIs) through a greedy-based technique, providing improved competitive guarantees. The algorithm is analyzed in two scenarios: general graphs with edge arrivals and bipartite graphs with vertex arrivals. The study focuses on maximizing expected rewards under limited information constraints.
In un'altra lingua
dal contenuto originale
arxiv.org
Approfondimenti chiave tratti da
by Cons... alle arxiv.org 03-19-2024
https://arxiv.org/pdf/2111.03174.pdfDomande più approfondite