We study best arm identification in a variant of the multi-armed bandit
...
We analyse a coalition formation game between strategic service provider...
We consider a constrained, pure exploration, stochastic multi-armed band...
A two-sided matching system is considered, where servers are assumed to
...
We consider the problem of cost-optimal utilization of a crowdsourcing
p...
We consider a population, partitioned into a set of communities, and stu...
We analyse a coalition formation game between strategic service provider...
We consider the problem of optimal charging/discharging of a bank of
het...
The problem of scheduling jobs and choosing their respective speeds with...
A multiple server setting is considered, where each server has tunable s...
Traditional multi-armed bandit (MAB) formulations usually make certain
a...
We study regret minimization in a stochastic multi-armed bandit setting ...
We consider a stochastic multi-armed bandit setting and study the proble...
Over the past decade, distributed CSMA, which forms the basis for WiFi, ...
The performance evaluation of loss service systems, where customers who
...
Revenue sharing contracts between Content Providers (CPs) and Internet
S...
Can the popular shortest remaining processing time (SRPT) algorithm achi...
Speed scaling for a tandem server setting is considered, where there is ...
Partial sharing allows providers to possibly pool a fraction of their
re...
We analyze the effect of sponsored data platforms when Internet service
...
Classical multi-armed bandit problems use the expected value of an arm a...
We consider a single server queueing system with two classes of jobs: ea...
Fragmentation of expensive resources, e.g., spectrum for wireless servic...
The development of communication protocols for teleoperation with force
...