The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Distributed convergence to Nash equilibria in two-network zero-sum games
Abstract
This paper considers a class of strategic scenarios in which two networks of agents have opposing objectives with regard to the optimization of a common objective function. In the resulting zero-sum game, individual agents collaborate with neighbors in their respective network and have only partial knowledge of the state of the agents in the other network. For the case when the interaction topology of each network is undirected, we synthesize a distributed saddle-point strategy and establish its convergence to the Nash equilibrium for the class of strictly concave-convex and locally Lipschitz objective functions. We also show that this dynamics does not converge in general if the topologies are directed. This justifies the introduction, in the directed case, of a generalization of this distributed dynamics which we show converges to the Nash equilibrium for the class of strictly concave-convex differentiable functions with globally Lipschitz gradients. The technical approach combines tools from algebraic graph theory, nonsmooth analysis, set-valued dynamical systems, and game theory.
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
Consensus and Cooperation in Networked Multi-Agent Systems
Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 2×
“These works build on consensus-based dynamics (Olfati-Saber et al., 2007; Ren and Beard, 2008; Bullo et al., 2009;Mesbahi and Egerstedt, 2010) to find the solutions of the optimization problem in a variety of scenarios and are designed in discrete”
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
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 1×
“These works build on consensus-based dynamics (Olfati-Saber et al., 2007; Ren and Beard, 2008; Bullo et al., 2009; Mesbahi and Egerstedt, 2010) to find the solutions of the optimization problem in a variety of scenarios and are designed in discrete time.”
Distributed Consensus in Multi-vehicle Cooperative Control
Ren, W., & Beard, R. W. (2008) · Communications and Control Engineering · doi:10.1007/978-1-84800-015-5 · Cited by 2,826
On Distributed Convex Optimization Under Inequality and Equality Constraints
Zhu, M., & Martinez, S. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2167817 · Cited by 759
Cited by
Distributed Nash Equilibrium Seeking by a Consensus Based Approach
Ye, M., & Hu, G. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2688452 · Cited by 520
A 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: A gossip-based algorithm
Salehisadaghiani, F., & Pavel, L. (2016) · Automatica · doi:10.1016/j.automatica.2016.06.004 · Cited by 309
Game Design and Analysis for Price-Based Demand Response: An Aggregate Game Approach
Ye, M., & Hu, G. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2524452 · Cited by 287
Metadata
- Authors
- Gharesifard, B., & Cortés, J.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2013-06
- Volume
- 49
- Issue
- 6
- Pages
- 1683-1692
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2056226204
- Cited by
- 188
- References
- 5
- FWCI
- 7.49
- 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.