5 papers
Non-Asymptotic Performance Analysis of Size-Based Routing Policies
E. Bachmat, J. Doncel
We investigate the performance of two size-based routing policies: the Size Interval Task Assignment (SITA) and Task Assignment based on Guessing Size (TAGS). We consider a system…
Flexibility can hurt dynamic matching system performance
Arnaud Cadas, Josu Doncel, Jean-Michel Fourneau +1
We study the performance of general dynamic matching models. This model is defined by a connected graph, where nodes represent the class of items and the edges the compatibilities…
Age of Information in a Decentralized Network of Parallel Queues with Routing and Packets Losses
Josu Doncel, Mohamad Assaad
The paper deals with Age of Information (AoI) in a network of multiple sources and parallel queues with buffering capabilities, preemption in service and losses in served packets.…
Discrete Mean Field Games: Existence of Equilibria and Convergence
Josu Doncel, Nicolas Gast, Bruno Gaujal
We consider mean field games with discrete state spaces (called discrete mean field games in the following) and we analyze these games in continuous and discrete time, over finite…
Optimal Control of Dynamic Bipartite Matching Models
Arnaud Cadas, Ana Bušić, Josu Doncel
A dynamic bipartite matching model is given by a bipartite matching graph which determines the possible matchings between the various types of supply and demand items. Both supply…