IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v72y2024i3p1049-1070.html
   My bibliography  Save this article

Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems

Author

Listed:
  • Daniel Freund

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142)

  • Thodoris Lykouris

    (Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142)

  • Wentao Weng

    (Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02142)

Abstract

We study decentralized multiagent learning in bipartite queueing systems, a standard model for service systems. In particular, N agents request service from K servers in a fully decentralized way, that is, by running the same algorithm without communication. Previous decentralized algorithms are restricted to symmetric systems, have performance that is degrading exponentially in the number of servers, require communication through shared randomness and unique agent identities, and are computationally demanding. In contrast, we provide a simple learning algorithm that, when run decentrally by each agent, leads the queueing system to have efficient performance in general asymmetric bipartite queueing systems while also having additional robustness properties. Along the way, we provide the first provably efficient upper confidence bound–based algorithm for the centralized case of the problem.

Suggested Citation

  • Daniel Freund & Thodoris Lykouris & Wentao Weng, 2024. "Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems," Operations Research, INFORMS, vol. 72(3), pages 1049-1070, May.
    • Handle: RePEc:inm:oropre:v:72:y:2024:i:3:p:1049-1070
    DOI: 10.1287/opre.2022.0291
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.0291
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.0291?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:72:y:2024:i:3:p:1049-1070. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.