Online learning to rank (OLTR) is a sequential decision-making problem w...
We introduce and study the online pause and resume problem. In this prob...
We study contextual combinatorial bandits with probabilistically trigger...
We introduce a class of networked Markov potential games where agents ar...
We study two-player zero-sum stochastic games, and propose a form of
ind...
We study a multi-agent reinforcement learning (MARL) problem where the a...
The online knapsack problem is a classic online resource allocation prob...
We consider the problem of convex function chasing with black-box advice...
Learning a dynamical system requires stabilizing the unknown dynamics to...
This paper studies the trade-off between the degree of decentralization ...
As the number of prosumers with distributed energy resources (DERs) grow...
In ridesharing platforms such as Uber and Lyft, it is observed that driv...
We examine the problem of online optimization, where a decision maker mu...
We study a variant of online optimization in which the learner receives
...
This paper leverages machine-learned predictions to design competitive
a...
Cloud platforms' growing energy demand and carbon emissions are raising
...
In addition to traditional concerns such as throughput and latency, fres...
While users claim to be concerned about privacy, often they do little to...
Linear time-varying (LTV) systems are widely used for modeling real-worl...
The design of online algorithms has tended to focus on algorithms with
w...
We introduce and study a general version of the fractional online knapsa...
Model-free learning-based control methods have seen great success recent...
It has long been recognized that multi-agent reinforcement learning (MAR...
We study distributed reinforcement learning (RL) for a network of agents...
Scheduling precedence-constrained tasks is a classical problem that has ...
We consider the load balancing problem in large-scale heterogeneous syst...
This paper studies online control with adversarial disturbances using to...
We consider a general asynchronous Stochastic Approximation (SA) scheme
...
We study reinforcement learning (RL) in a setting with a network of agen...
We study online optimization in a setting where an online learner seeks ...
We study online convex optimization in a setting where the learner seeks...
In this work, we analyze the worst case efficiency loss of online platfo...
This paper studies online optimization under inventory (budget) constrai...
Motivated by the application of energy storage management in electricity...
We consider Online Convex Optimization (OCO) in the setting where the co...
Loyalty programs are important tools for sharing platforms seeking to gr...
We study Smoothed Online Convex Optimization, a version of online convex...
This paper studies the revenue of simple mechanisms in settings where a
...
This paper presents an acceleration framework for packing linear program...