From the 1 of 10 linked papers with an AI index.
10 papers
Kernel Methods for Refined Prophet Inequalities
Patrick Loiseau, Mathieu Molina, Vianney Perchet +2
The single-selection prophet inequality is a canonical Bayesian online selection problem in which independent nonnegative values arrive sequentially and the decision-maker must irr…
Free-Order Online Selection for k-Systems
Kristóf Bérczi, Vasilis Livanos, José A. Soto +1
The paper studies online selection problems on bipartite graphs with combinatorial constraints, introducing k‑growth systems and providing Ω(1/k²)-competitive algorithms for free‑o…
Threshold Dynamics and Correlated Prophet Inequalities
José Correa, Maximilian Fichtl, Reda Jlibene +4
Prophet inequalities have become a central tool for analyzing the performance of online algorithms. However, most existing results assume that input random variables are independen…
Tight Sample Complexity for Low-Degree and Sparse Boolean Polynomials
Jasper van Doornmalen, Mathieu Molina, Victor Verdugo +1
Motivated by the optimization of bounded binary black-box functions, we study the problem of learning polynomial surrogates over the Boolean hypercube. To ensure that optimizing th…
Competition Versus Complexity in Multiple-Selection Prophet Inequalities
Eugenio Cruz-Ossa, Sebastian Perez-Salazar, Victor Verdugo
Competition complexity formalizes a compelling intuition: rather than refining the mechanism, how much additional competition is sufficient for a simple mechanism to compete with a…
Linear Programming Hierarchies Collapse under Symmetry
Yuri Faenza, VÃctor Verdugo, José Verschae +1
The presence of symmetries is one of the central structural features that make some integer programs challenging for state-of-the-art solvers. In this work, we study the efficacy o…