220 citations · 930 across the 74 of their papers we have counts for
78 papers
Optimal Regret for Online Storage Control via Cumulative Policies
Kamiar Asgari, Michael J. Neely
We study online control of a scalar storage system with adversarial nonnegative arrivals, known retention coefficient, and convex costs depending on both state and action. Each act…
Online Constrained Control of Storage Systems via Simplex Disturbance-Action Policies
Kamiar Asgari, Michael J. Neely
We study online control of a scalar storage system with nonnegative adversarial resource arrivals and state-dependent action constraints. The adversarial, time-varying cost depends…
A Two-Player Resource-Sharing Game with Asymmetric Information
Mevan Wijewardena, Michael J. Neely
This paper considers a two-player game where each player chooses a resource from a finite collection of options. Each resource brings a random reward. Both players have statistical…
Projection-Free Non-Smooth Convex Programming
Kamiar Asgari, Michael J. Neely
We study nonsmooth convex minimization over a compact convex set without projections. For a globally -Lipschitz objective, optimistic primal-dual updates give error at most $2LD…
Random Variables with Measurability Constraints with Application to Opportunistic Scheduling
Michael J. Neely
This paper proves a representation theorem regarding sequences of random elements that take values in a Borel space and are measurable with respect to the sigma algebra generated b…
Repeated Games, Optimal Channel Capture, and Open Problems for Slotted Multiple Access
Michael J. Neely
This paper revisits a classical problem of slotted multiple access with success, idle, and collision events on each slot. First, results of a 2-user multiple access game are report…