Efficient decentralized multi-agent learning in asymmetric queuing systems
We study decentralized multi-agent learning in bipartite queuing systems, a standard model
for service systems. In particular, N agents request service from K servers in a fully …
for service systems. In particular, N agents request service from K servers in a fully …
Asynchronous proportional response dynamics: convergence in markets with adversarial scheduling
Y Kolumbus, M Levy, N Nisan - Advances in Neural …, 2023 - proceedings.neurips.cc
Abstract We study Proportional Response Dynamics (PRD) in linear Fisher markets, where
participants act asynchronously. We model this scenario as a sequential process in which at …
participants act asynchronously. We model this scenario as a sequential process in which at …
Learning and information in stochastic networks and queues
We review the role of information and learning in the stability and optimization of queueing
systems. In recent years, techniques from supervised learning, online learning, and …
systems. In recent years, techniques from supervised learning, online learning, and …
Decentralized learning in online queuing systems
F Sentenac, E Boursier… - Advances in Neural …, 2021 - proceedings.neurips.cc
Motivated by packet routing in computer networks, online queuing systems are composed of
queues receiving packets at different rates. Repeatedly, they send packets to servers, each …
queues receiving packets at different rates. Repeatedly, they send packets to servers, each …
Decentralized scheduling with qos constraints: Achieving o (1) qos regret of multi-player bandits
We consider a decentralized multi-player multi-armed bandit (MP-MAB) problem where
players cannot observe the actions and rewards of other players and no explicit …
players cannot observe the actions and rewards of other players and no explicit …
Virtues of patience in strategic queuing systems
J Gaitonde, E Tardos - Proceedings of the 22nd ACM Conference on …, 2021 - dl.acm.org
We consider the problem of selfish agents in discrete-time queuing systems, where
competitive queues try to get their packets served. In this model, a queue gets to send a …
competitive queues try to get their packets served. In this model, a queue gets to send a …
Constant or Logarithmic Regret in Asynchronous Multiplayer Bandits with Limited Communication
H Richard, E Boursier… - … Conference on Artificial …, 2024 - proceedings.mlr.press
Multiplayer bandits have recently garnered significant attention due to their relevance in
cognitive radio networks. While the existing body of literature predominantly focuses on …
cognitive radio networks. While the existing body of literature predominantly focuses on …
Serial monopoly on blockchains
N Nisan - arXiv preprint arXiv:2311.12731, 2023 - arxiv.org
We study the following problem that is motivated by Blockchains where``miners''are serially
given the monopoly for assembling transactions into the next block. Our model has a single …
given the monopoly for assembling transactions into the next block. Our model has a single …
Stability of decentralized queueing networks beyond complete bipartite cases
Gaitonde and Tardos [,] recently studied a model of queueing networks where queues
compete for servers and re-send returned packets in future rounds. They quantify the …
compete for servers and re-send returned packets in future rounds. They quantify the …
Robust Pseudo-Markets for Reusable Public Resources
We study non-monetary mechanisms for the fair and efficient allocation of reusable public
resources, ie, resources used for varying durations. We consider settings where a limited …
resources, ie, resources used for varying durations. We consider settings where a limited …