We define a general framework for a large class of combinatorial multi-armed bandit (CMAB)
problems, where simple arms with unknown istributions form\em super arms. In each round …

In the past few years, differential privacy has become a standard concept in the area of
privacy. One of the most important problems in this field is to answer queries while …

In real crowdsourcing applications, each label from a crowd usually comes with a certain
cost. Given a pre-fixed amount of budget, since different tasks have different ambiguities and …

In the Multi-Armed Bandit (MAB) problem, there is a given set of arms with unknown reward
models. At each time, a player selects one arm to play, aiming to maximize the total …

Many factors influence the connection states between nodes of wireless sensor networks,
such as physical distance, and the network load, making the network's edge length dynamic …

We investigate stochastic combinatorial multi-armed bandit with semi-bandit feedback
(CMAB). In CMAB, the question of the existence of an efficient policy with an optimal …

This paper studies online shortest path routing over multihop networks. Link costs or delays
are time varying and modeled by independent and identically distributed random processes …

We consider the problem faced by a service platform that needs to match limited supply with
demand while learning the attributes of new users to match them better in the future. We …

Energy efficient navigation constitutes an important challenge in electric vehicles, due to
their limited battery capacity. We employ a Bayesian approach to model the energy …

We analyze the problem of linear bandits under heavy tailed noise. Most of of the work on
linear bandits has been based on the assumption of bounded or sub-Gaussian noise …