$No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting$

No-Regret M ${}^{\natural}$ -Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting

21 May 2024

Papers citing "No-Regret M${}^{\natural}$-Concave Function Maximization: Stochastic Bandit Algorithms and NP-Hardness of Adversarial Full-Information Setting"

2 / 2 papers shown

Title
Sum-max Submodular Bandits Stephen Pasteris Alberto Rumi Fabio Vitale Nicolò Cesa-Bianchi 20 2 0 10 Nov 2023
Adversarial Combinatorial Bandits with General Non-linear Reward Functions Xi Chen Yanjun Han Yining Wang 30 16 0 05 Jan 2021