research
∙
05/10/2023
Best Arm Identification in Bandits with Limited Precision Sampling
We study best arm identification in a variant of the multi-armed bandit ...
share
research
∙
04/25/2023
On the ubiquity of duopolies in constant sum congestion games
We analyse a coalition formation game between strategic service provider...
research
∙
11/27/2022
Constrained Pure Exploration Multi-Armed Bandits with a Fixed Budget
We consider a constrained, pure exploration, stochastic multi-armed band...
research
∙
07/24/2022
Non-asymptotic near optimal algorithms for two sided matchings
A two-sided matching system is considered, where servers are assumed to ...
research
∙
07/05/2022
Unsupervised Crowdsourcing with Accuracy and Cost Guarantees
We consider the problem of cost-optimal utilization of a crowdsourcing p...
research
∙
11/16/2021
Sequential Community Mode Estimation
We consider a population, partitioned into a set of communities, and stu...
research
∙
09/27/2021
Coalition Formation in Constant Sum Queueing Games
We analyse a coalition formation game between strategic service provider...
research
∙
09/15/2021
Optimal Cycling of a Heterogenous Battery Bank via Reinforcement Learning
We consider the problem of optimal charging/discharging of a bank of het...
research
∙
08/16/2021
Speed Scaling with Multiple Servers Under A Sum Power Constraint
The problem of scheduling jobs and choosing their respective speeds with...
research
∙
05/19/2021
Speed Scaling On Parallel Servers with MapReduce Type Precedence Constraints
A multiple server setting is considered, where each server has tunable s...
research
∙
08/28/2020
Statistically Robust, Risk-Averse Best Arm Identification in Multi-Armed Bandits
Traditional multi-armed bandit (MAB) formulations usually make certain a...
research
∙
06/22/2020
Bandit algorithms: Letting go of logarithmic regret for statistical robustness
We study regret minimization in a stochastic multi-armed bandit setting ...
research
∙
06/17/2020
Constrained regret minimization for multi-criterion multi-armed bandits
We consider a stochastic multi-armed bandit setting and study the proble...
research
∙
12/23/2019
Adaptive flow-level scheduling for the IoT MAC
Over the past decade, distributed CSMA, which forms the basis for WiFi, ...
research
∙
10/28/2019
Please come back later: Benefiting from deferrals in service systems
The performance evaluation of loss service systems, where customers who ...
research
∙
08/26/2019
Revenue Sharing in the Internet: A Moral Hazard Approach and a Net-neutrality Perspective
Revenue sharing contracts between Content Providers (CPs) and Internet S...
research
∙
07/21/2019
Multiple Server SRPT with speed scaling is competitive
Can the popular shortest remaining processing time (SRPT) algorithm achi...
research
∙
07/10/2019
Speed Scaling with Tandem Servers
Speed scaling for a tandem server setting is considered, where there is ...
research
∙
06/09/2019
Partial Server Pooling in Redundancy Systems
Partial sharing allows providers to possibly pool a fraction of their re...
research
∙
06/03/2019
Sponsored data with ISP competition
We analyze the effect of sponsored data platforms when Internet service ...
research
∙
06/03/2019
Distribution oblivious, risk-aware algorithms for multi-armed bandits with unbounded rewards
Classical multi-armed bandit problems use the expected value of an arm a...
research
∙
04/13/2019
Dynamic scheduling in a partially fluid, partially lossy queueing system
We consider a single server queueing system with two classes of jobs: ea...
research
∙
08/19/2018
Sharing within limits: Partial resource pooling in loss systems
Fragmentation of expensive resources, e.g., spectrum for wireless servic...
research
∙
05/28/2018