Search Results for author:
Found 4 papers, 0 papers with code
Learning-Based Pricing and Matching for Two-Sided Queues
We prove that our proposed algorithm yields a sublinear regret $\tilde{O}(T^{5/6})$ and queue-length bound $\tilde{O}(T^{2/3})$, where $T$ is the time horizon.
Online Nonstochastic Control with Adversarial and Static Constraints
This subroutine also achieves the state-of-the-art regret and constraint violation bounds for constrained online convex optimization problems, which is of independent interest.
Learning While Scheduling in Multi-Server Systems with Unknown Statistics: MaxWeight with Discounted UCB
We prove that under our algorithm the asymptotic average queue length is bounded by one divided by the traffic slackness, which is order-wise optimal.
Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonment
To understand the exploration, exploitation, and engagement in these systems, we propose a new model, called MAB-A where "A" stands for abandonment and the abandonment probability depends on the current recommended item and the user's past experience (called state).
