The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks
Open accessAbstract
In this paper, we consider the problem of distributed Nash equilibrium (NE) seeking over networks, a setting in which players have limited local information on the others' decisions. We start from a continuous-time gradient-play dynamics that converges to an NE under strict monotonicity of the pseudogradient and assumes perfect information. We consider how to modify it in the case of partial, or networked information between players. We propose an augmented gradient-play dynamics with correction, in which players communicate locally only with their neighbors to compute an estimate of the other players' actions. We derive the new dynamics based on the reformulation as a multiagent coordination problem over an undirected graph. We exploit incremental passivity properties and show that a synchronizing, distributed Laplacian feedback can be designed using relative estimates of the neighbors. Under a strict monotonicity property of the pseudogradient, we show that the augmented gradient-play dynamics converges to consensus on the NE of the game. We further discuss two cases that highlight the tradeoff between properties of the game and the communication graph.
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×
“, [41], we note that the agents dynamics are not integrators or decoupled identical LTI MIMO systems as in typical consensus literature.”
BackgroundResultGodsil, C., & Royle, G. (2001) · Graduate Texts in Mathematics · doi:10.1007/978-1-4613-0163-9 · Cited by 8,154
Differential Inclusions: Set-Valued Maps and Viability Theory
Aubin, J.-P., & Cellina, A. (1984) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-69512-4 · Cited by 3,393
Fundamentals of Convex Analysis
Hiriart-Urruty, J.-B., & Lemaréchal, C. (2001) · Springer eBooks · doi:10.1007/978-3-642-56468-0 · Cited by 1,402
Passivity as a Design Tool for Group Coordination
Arcak, M. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.902733 · Cited by 781
Projected Dynamical Systems and Variational Inequalities with Applications
Nagurney, A., & Zhang, D. (1996) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-2301-7 · Cited by 609
Game theory for cognitive radio networks: An overview
Wang, B., Wu, Y., & Liu, K. J. R. (2010) · Computer Networks · doi:10.1016/j.comnet.2010.04.004 · Cited by 497
ART: An Attack-Resistant Trust Management Scheme for Securing Vehicular Ad Hoc Networks
Li, W., & Song, H. (2016) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2015.2494017 · Cited by 487
Strategic Interaction and Networks
Bramoullé, Y., Kranton, R., & D'Amours, M. (2014) · American Economic Review · doi:10.1257/aer.104.3.898 · Cited by 467
Nash Equilibrium Seeking in Noncooperative Games
Frihauf, P., Krstic, M., & Basar, T. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2173412 · Cited by 432
Optimal Pricing in Networks with Externalities
Candogan, O., Bimpikis, K., & Ozdaglar, A. (2012) · Operations Research · doi:10.1287/opre.1120.1066 · Cited by 405
A control perspective for centralized and distributed convex optimization
Wang, J., & Elia, N. (2011) · IEEE Conference on Decision and Control and European Control Conference · doi:10.1109/cdc.2011.6161503 · Cited by 398
Dynamic fictitious play, dynamic gradient play, and distributed convergence to Nash equilibria
Shamma, J. S., & Arslan, G. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.843878 · Cited by 388
Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
Stankovic, M. S., Johansson, K. H., & Stipanovic, D. M. (2012) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2011.2174678 · Cited by 358
Distributed 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
Opinion dynamics in social networks with stubborn agents: Equilibrium and convergence rate
Ghaderi, J., & Srikant, R. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.034 · Cited by 325
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
Self-citationDesigning 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
An 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
Self-citationDistributed algorithms for the computation of noncooperative equilibria
Li, S., & Başar, T. (1987) · Automatica · doi:10.1016/0005-1098(87)90081-1 · Cited by 192
Distributed convergence to Nash equilibria in two-network zero-sum games
Gharesifard, B., & Cortés, J. (2013) · Automatica · doi:10.1016/j.automatica.2013.02.062 · Cited by 188
Nash Equilibrium Computation in Subnetwork Zero-Sum Games With Switching Communications
Lou, Y., Hong, Y., Xie, L., Shi, G., & Johansson, K. H. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2504962 · Cited by 172
Opportunistic Spectrum Access for CR-VANETs: A Game-Theoretic Approach
Cheng, N., Zhang, N., Lu, N., Shen, X., Mark, J. W., & Liu, F. (2013) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2013.2274201 · Cited by 137
Competitive Targeted Advertising Over Networks
Bimpikis, K., Ozdaglar, A., & Yildiz, E. (2016) · Operations Research · doi:10.1287/opre.2015.1430 · Cited by 133
Dynamic coupling design for nonlinear output agreement and time-varying flow control
Bürger, M., & Persis, C. D. (2014) · Automatica · doi:10.1016/j.automatica.2014.10.081 · Cited by 101
Game Theory with Engineering Applications
Bauso, D. (2016) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611974287 · Cited by 99
Distributed Learning for Stochastic Generalized Nash Equilibrium Problems
Yu, C.-K., van der Schaar, M., & Sayed, A. H. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2695451 · Cited by 96
Empirical Centroid Fictitious Play: An Approach for Distributed Learning in Multi-Agent Games
Swenson, B., Kar, S., & Xavier, J. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2434327 · Cited by 73
Distributed Nash equilibrium seeking in networked graphical games
Salehisadaghiani, F., & Pavel, L. (2017) · Automatica · doi:10.1016/j.automatica.2017.09.016 · Cited by 72
Self-citationCompetitive Spectrum Access in Cognitive Radio Networks: Graphical Game and Learning
Li, H., & Han, Z. (2010) · 2010 IEEE Wireless Communication and Networking Conference · doi:10.1109/wcnc.2010.5506285 · Cited by 67
EQUILIBRIUM, EVOLUTIONARY STABILITY AND GRADIENT DYNAMICS
Flåm, S. D. (2002) · International Game Theory Review · doi:10.1142/s0219198902000756 · Cited by 64
Cournot competition in networked markets
Bimpikis, K., Ehsani, S., & İlkılıç, R. (2014) · ACM Conference on Economics and Computation (EC) · doi:10.1145/2600057.2602882 · Cited by 58
Distributed consensus in noncooperative congestion games: An application to road pricing
Wang, X., Xiao, N., Wongpiromsarn, T., Xie, L., Frazzoli, E., & Rus, D. L. (2013) · International Conference on Control and Automation · doi:10.1109/icca.2013.6565153 · Cited by 51
Distributed Nash Equilibrium Seeking via the Alternating Direction Method of Multipliers
Salehisadaghiani, F., & Pavel, L. (2017) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2017.08.983 · Cited by 41
Self-citationDistributed Stochastic Approximation with Local Projections
Shah, S. M., & Borkar, V. S. (2018) · SIAM Journal on Optimization · doi:10.1137/17m1128460 · Cited by 15
Metadata
- Authors
- Gadjov, D., & Pavel, L.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2019-03
- Volume
- 64
- Issue
- 3
- Pages
- 1077-1092
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2611964096
- Cited by
- 339
- References
- 35
- FWCI
- 10.89
- 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
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.