no code implementations • 13 Feb 2024 • Aviad Rubinstein, Junyao Zhao
On the other hand, Mansour et al. (2022) showed that a more sophisticated class of algorithms called no-polytope-swap-regret algorithms are sufficient to cap the optimizer's utility at the Stackelberg utility in any repeated Bayesian game (including Bayesian first-price auctions), and they pose the open question whether no-polytope-swap-regret algorithms are necessary to cap the optimizer's utility.
no code implementations • 20 Feb 2018 • Ilija Bogunovic, Junyao Zhao, Volkan Cevher
In this work, we present a new algorithm Oblivious-Greedy and prove the first constant-factor approximation guarantees for a wider class of non-submodular objectives.
