The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Distributed Algorithms for Aggregative Games on Graphs
Abstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equilibrium points in n -person games
Nash, J. F. (1950) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.36.1.48 · Cited by 7,560
Distributed Subgradient Methods for Multi-Agent Optimization
Nedic, A., & Ozdaglar, A. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2009515 · Cited by 3,719
Monderer, D., & Shapley, L. S. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0044 · Cited by 3,543
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97544 · Cited by 3,521
The Theory of Learning in Games
Drew Fudenberg, B., & Levine, D. K. (1998) · MIT Press Books · Cited by 2,455
Boyd, S., Ghosh, A., Prabhakar, B., & Shah, D. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874516 · Cited by 2,439
Constrained Consensus and Optimization in Multi-Agent Networks
Nedic, A., Ozdaglar, A., & Parrilo, P. A. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2041686 · Cited by 2,086
(1972) · Elsevier eBooks · doi:10.1016/c2013-0-06164-6 · Cited by 1,728
The sciences of the artificial (3rd ed.)
Simon, H. A. (1996) · Cited by 1,283
Dudley, R. M. (2002) · Cambridge University Press eBooks · doi:10.1017/cbo9780511755347 · Cited by 1,281
Cited by
Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
Nedić, A., Olshevsky, A., & Shi, W. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1084316 · Cited by 1,069
“A similar technique has been introduced in [77] for dynamically tracking the average state of a multi-agent system, and for tracking some network-wide aggregate quantities in [28,57].”
MethodSelf-citationA Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
Gadjov, D., & Pavel, L. (2019) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2018.2833140 · Cited by 339
Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Liang, S., Yi, P., & Hong, Y. (2017) · Automatica · doi:10.1016/j.automatica.2017.07.064 · Cited by 328
Distributed Optimization for Control
Nedić, A., & Liu, J. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105131 · Cited by 302
Self-citationAn operator splitting approach for distributed generalized Nash equilibria computation
Yi, P., & Pavel, L. (2019) · Automatica · doi:10.1016/j.automatica.2019.01.008 · Cited by 271
Nonconvex distributed feedback optimization for aggregative cooperative robotics
Carnevale, G., Mimmo, N., & Notarstefano, G. (2024) · Automatica · doi:10.1016/j.automatica.2024.111767 · Cited by 23
Metadata
- Authors
- Koshal, J., Nedić, A., & Shanbhag, U. V.
- Venue
- Operations Research
- Published
- 2016-06
- Volume
- 64
- Issue
- 3
- Pages
- 680-704
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2345998142
- Cited by
- 341
- References
- 37
- FWCI
- 26.64
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.