Publications en collaboration avec des chercheurs de Université de Toulouse (43)

2023

  1. Price of Anarchy with multiple information sources under competition

    Operations Research Letters, Vol. 51, Núm. 6, pp. 605-611

2022

  1. A Token-Based Central Queue with Order-Independent Service Rates

    Operations Research, Vol. 70, Núm. 1, pp. 545-561

  2. On the Whittle index of Markov modulated restless bandits

    Queueing Systems, Vol. 102, Núm. 3-4, pp. 373-430

2021

  1. A Resource Sharing Game for the Freshness of Status Updates

    Performance Evaluation Review, Vol. 49, Núm. 2, pp. 15-17

  2. On the computation of Whittle’s index for Markovian restless bandits

    Mathematical Methods of Operations Research, Vol. 93, Núm. 1, pp. 179-208

  3. On the stability of redundancy models

    Operations Research, Vol. 69, Núm. 5, pp. 1540-1565

2020

  1. SCHEDULING in A SINGLE-SERVER QUEUE with STATE-DEPENDENT SERVICE RATES

    Probability in the Engineering and Informational Sciences, Vol. 34, Núm. 4, pp. 507-521

2019

  1. On the impact of mobility in cellular networks

    Proceedings - 17th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2019

  2. Performance Degradation in Parallel-Server Systems

    IEEE/ACM Transactions on Networking, Vol. 27, Núm. 2, pp. 875-888

  3. Performance analysis of space–time priority queues

    Performance Evaluation, Vol. 133, pp. 25-42

  4. Redundancy with processor sharing servers

    Performance Evaluation Review

  5. Scheduling users in drive-thru Internet: a multi-armed bandit approach

    Proceedings - 17th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2019

2017

  1. Economies of scale in parallel-server systems

    Proceedings - IEEE INFOCOM

  2. Scheduling of multi-class multi-server queueing systems with abandonments

    Journal of Scheduling, Vol. 20, Núm. 2, pp. 129-145

2016

  1. Dynamic Control of Birth-and-Death Restless Bandits: Application to Resource-Allocation Problems

    IEEE/ACM Transactions on Networking, Vol. 24, Núm. 6, pp. 3812-3825

  2. Optimal dynamic resource allocation to prevent defaults

    Operations Research Letters, Vol. 44, Núm. 4, pp. 451-456

  3. Sojourn time approximations for a discriminatory processor sharing queue

    ACM Transactions on Modeling and Performance Evaluation of Computing Systems, Vol. 1, Núm. 1