Stochastic approximation of symmetric Nash equilibria in queueing games
From MaRDI portal
Publication:6366384
DOI10.1287/OPRE.2021.0306arXiv2104.13949MaRDI QIDQ6366384FDOQ6366384
Liron Ravner, Ran I. Snitkovsky
Publication date: 28 April 2021
Abstract: We suggest a novel stochastic-approximation algorithm to compute a symmetric Nash-equilibrium strategy in a general queueing game with a finite action space. The algorithm involves a single simulation of the queueing process with dynamic updating of the strategy at regeneration times. Under mild assumptions on the utility function and on the regenerative structure of the queueing process, the algorithm converges to a symmetric equilibrium strategy almost surely. This yields a powerful tool that can be used to approximate equilibrium strategies in a broad range of strategic queueing models in which direct analysis is impracticable.
This page was built for publication: Stochastic approximation of symmetric Nash equilibria in queueing games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6366384)
