The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Distributed Nash equilibrium seeking for aggregative games with coupled constraints
Open accessAbstract
Abstract In this paper, we study a distributed continuous-time design for aggregative games with coupled constraints in order to seek the generalized Nash equilibrium by a group of agents via simple local information exchange. To solve the problem, we propose a distributed algorithm based on projected dynamics and non-smooth tracking dynamics, even for the case when the interaction topology of the multi-agent network is time-varying. Moreover, we prove the convergence of the non-smooth algorithm for the distributed game by taking advantage of its special structure and also combining the techniques of the variational inequality and Lyapunov function.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Godsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Rockafellar, R. T., & Wets, R. J. B. (1998) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-02431-3 · Cited by 4,086
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
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97544 · Cited by 3,521
Kia, S. S., Cortés, J., & Martínez, S. (2015) · Automatica · doi:10.1016/j.automatica.2015.03.001 · Cited by 694
Yi, P., Hong, Y., & Liu, F. (2016) · Automatica · doi:10.1016/j.automatica.2016.08.007 · Cited by 478
Self-citationDistributed Algorithms for Aggregative Games on Graphs
Koshal, J., Nedić, A., & Shanbhag, U. V. (2016) · Operations Research · doi:10.1287/opre.2016.1501 · Cited by 341
Distributed Average Tracking of Multiple Time-Varying Reference Signals With Bounded Derivatives
Chen, F., Cao, Y., & Ren, W. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2012.2199176 · Cited by 320
Distributed Nash equilibrium seeking: A gossip-based algorithm
Salehisadaghiani, F., & Pavel, L. (2016) · Automatica · doi:10.1016/j.automatica.2016.06.004 · Cited by 309
Designing Games for Distributed Optimization
Li, N., & Marden, J. R. (2013) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2013.2246511 · Cited by 290
Metadata
- Authors
- Liang, S., Yi, P., & Hong, Y.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2017-11
- Volume
- 85
- Pages
- 179-185
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2519129141
- Cited by
- 328
- References
- 17
- FWCI
- 15.41
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed Nash equilibrium seeking for aggregative games with coupled constraints. https://app.cochat.ai/papers/10.1016/j.automatica.2017.07.064
- The paper
- Liang, S., Yi, P., & Hong, Y. (2017). Distributed Nash equilibrium seeking for aggregative games with coupled constraints. Automatica. https://doi.org/10.1016/j.automatica.2017.07.064
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.
