49 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centre Inria d'Université Côte d'AzurFR4 papers
- Institut national de recherche en sciences et technologies du numériqueFR4 papers
- Laboratoire Informatique d'AvignonFR2 papers
- Universidade Federal do Rio de JaneiroBR2 papers
- University of TwenteNL2 papers
- CentraleSupélecFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- DYOGENE: Dynamics of Geometric NetworksFR1 paper
- Eindhoven University of TechnologyNL1 paper
- Fudan UniversityCN1 paper
- Indian Institute of Technology BombayIN1 paper
- Indian Institute of Technology DelhiIN1 paper
9 papers
Whittle index based Q-learning for restless bandits with average reward
Konstantin E. Avrachenkov, Vivek S. Borkar
A novel reinforcement learning algorithm is introduced for multiarmed restless bandits with average reward, using the paradigms of Q-learning and Whittle index. Specifically, we le…
How often should I access my online social networks?
Eduardo Hargreaves, Daniel Sadoc Menasché, Giovanni Neglia
Users of online social networks are faced with a conundrum of trying to be always informed without having enough time or attention budget to do so. The retention of users on online…
Real-time enforcement of local energy market transactions respecting distribution grid constraints
José Horta, Eitan Altman, Mathieu Caujolle +2
Future electricity distribution grids will host a considerable share of the renewable energy sources needed for enforcing the energy transition. Demand side management mechanisms p…
A Stochastic Game Framework for Analyzing Computational Investment Strategies in Distributed Computing
Swapnil Dhamal, Walid Ben-Ameur, Tijani Chahed +3
We study a stochastic game framework with dynamic set of players, for modeling and analyzing their computational investment strategies in distributed computing. Players obtain a ce…
Mean Field Analysis of Personalized PageRank with Implications for Local Graph Clustering
Konstantin Avrachenkov, Arun Kadavankandy, Nelly Litvak
We analyse a mean-field model of Personalized PageRank on the Erdos-Renyi random graph containing a denser planted Erdos-Renyi subgraph. We investigate the regimes where the values…
A Low-Complexity Approach to Distributed Cooperative Caching with Geographic Constraints
Konstantin Avrachenkov, Jasper Goseling, Berksan Serbetci
We consider caching in cellular networks in which each base station is equipped with a cache that can store a limited number of files. The popularity of the files is known and the…
Cell planning for mobility management in heterogeneous cellular networks
Arpan Chattopadhyay, Bartłomiej Błaszczyszyn, Eitan Altman
In small cell networks, high mobility of users results in frequent handoff and thus severely restricts the data rate for mobile users. To alleviate this problem, we propose to use…
Hitting Times in Markov Chains with Restart and their Application to Network Centrality
Konstantin Avrachenkov, Alexey Piunovskiy, Yi Zhang
Motivated by applications in telecommunications, computer scienceand physics, we consider a discrete-time Markov process withrestart. At each step the process eitherwith a positive…
Forever Young: Aging Control For Smartphones In Hybrid Networks
Eitan Altman, Rachid El-Azouzi, Daniel Sadoc Menasche +1
The demand for Internet services that require frequent updates through small messages, such as microblogging, has tremendously grown in the past few years. Although the use of such…