Poster

Tue 14:00

Incentivizing Combinatorial Bandit Exploration
Xinyan Hu · Dung Ngo · Aleksandrs Slivkins · Steven Wu

Poster

Thu 14:00

Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
Xutong Liu · Jinhang Zuo · Siwei Wang · Carlee Joe-Wong · John C.S. Lui · Wei Chen

Poster

Wed 14:00

Finding Optimal Arms in Non-stochastic Combinatorial Bandits with Semi-bandit Feedback and Finite Budget
Jasmin Brandt · Viktor Bengs · Björn Haddenhorst · Eyke Hüllermeier

Poster

When Combinatorial Thompson Sampling meets Approximation Regret
Pierre Perrault

Poster

Wed 9:00

Online Learning and Pricing for Network Revenue Management with Reusable Resources
Huiwen Jia · Cong Shi · Siqian Shen

Poster

Tue 9:00

Collaborative Linear Bandits with Adversarial Agents: Near-Optimal Regret Bounds
Aritra Mitra · Arman Adibi · George J. Pappas · Hamed Hassani

Poster

Wed 14:00

Instance-optimal PAC Algorithms for Contextual Bandits
Zhaoqi Li · Lillian Ratliff · houssam nassif · Kevin Jamieson · Lalit Jain

Poster

Wed 9:00

On Elimination Strategies for Bandit Fixed-Confidence Identification
Andrea Tirinzoni · Rémy Degenne

Poster

Thu 9:00

Dynamic Learning in Large Matching Markets
Anand Kalvit · Assaf Zeevi

Poster

Thu 9:00

Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret
Orestis Papadigenopoulos · Constantine Caramanis · Sanjay Shakkottai

Poster

Wed 14:00

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
Arpit Agarwal · Rohan Ghuge · viswanath nagarajan

Poster

Wed 14:00

Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model
Su Jia · Andrew Li · R Ravi