IDEAS home Printed from
   My bibliography  Save this article

Distributed Algorithms for Aggregative Games on Graphs


  • Jayash Koshal

    () (Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, Illinois 61801)

  • Angelia Nedić

    () (Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, Illinois 61801)

  • Uday V. Shanbhag

    () (Department of Industrial and Manufacturing Engineering, Pennsylvania State University, University Park, Pennsylvania 16802)


We consider a class of Nash games, termed as aggregative games, being played over a networked system. In an aggregative game, a player’s objective is a function of the aggregate of all the players’ decisions. Every player maintains an estimate of this aggregate, and the players exchange this information with their local neighbors over a connected network. We study distributed synchronous and asynchronous algorithms for information exchange and equilibrium computation over such a network. Under standard conditions, we establish the almost-sure convergence of the obtained sequences to the equilibrium point. We also consider extensions of our schemes to aggregative games where the players’ objectives are coupled through a more general form of aggregate function. Finally, we present numerical results that demonstrate the performance of the proposed schemes.

Suggested Citation

  • Jayash Koshal & Angelia Nedić & Uday V. Shanbhag, 2016. "Distributed Algorithms for Aggregative Games on Graphs," Operations Research, INFORMS, vol. 64(3), pages 680-704, June.
  • Handle: RePEc:inm:oropre:v:64:y:2016:i:3:p:680-704

    Download full text from publisher

    File URL:
    Download Restriction: no


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. repec:gam:jgames:v:8:y:2017:i:3:p:25-:d:102325 is not listed on IDEAS


    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:64:y:2016:i:3:p:680-704. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.