The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
An operator splitting approach for distributed generalized Nash equilibria computation
Open accessAbstract
Abstract In this paper, we propose a distributed algorithm for computation of a generalized Nash equilibrium (GNE) in noncooperative games over networks. We consider games in which the feasible decision sets of all players are coupled together by a globally shared affine constraint. Adopting the variational GNE as a refined solution, we reformulate the problem as that of finding the zeros of a sum of monotone operators through a primal–dual analysis and an augmentation of variables. Then we introduce a distributed algorithm based on forward–backward operator splitting methods. Each player only needs to know its local objective function, local feasible set, and a local block of the affine constraint, and share information with its neighbours. However, each player also needs to observe the decisions that its objective function directly depends on to evaluate its local gradient. We show convergence of the proposed algorithm for fixed step-sizes under some mild assumptions. Moreover, a distributed algorithm with inertia is also introduced and analysed for distributed variational GNE seeking. Numerical simulations are given for networked Cournot competition with bounded market capacities, to illustrate the algorithm efficiency and performance.
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
Matrix Analysis and Applied Linear Algebra
Meyer, C. (2000) · doi:10.1137/1.9780898719512 · Cited by 3,565
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97544 · Cited by 3,521
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2017) · CMS Books in Mathematics · doi:10.1007/978-3-319-48311-5 · Cited by 3,307
Matrix analysis and applied linear algebra
(2001) · Choice Reviews Online · doi:10.5860/choice.38-5065 · Cited by 3,300
Convex Analysis and Monotone Operator Theory in Hilbert Spaces
Bauschke, H. H., & Combettes, P. L. (2011) · CMS Books in Mathematics · doi:10.1007/978-1-4419-9467-7 · Cited by 2,962
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×
“Graph theory The following concepts are reviewed from Mesbahi & Egerstedt (2010).”
Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
Rosen, J. B. (1965) · Econometrica · doi:10.2307/1911749 · Cited by 2,686
Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
Spall, J. C. (1992) · IEEE Transactions on Automatic Control · doi:10.1109/9.119632 · Cited by 2,283
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
A Social Equilibrium Existence Theorem*
Debreu, G. (1952) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.38.10.886 · Cited by 1,504
Condat, L. (2013) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-012-0245-9 · Cited by 912
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Graphical Models for Game Theory
Kearns, M. J., Littman, M. L., & Singh, S. P. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2281 · Cited by 544
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
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
Yi, P., Hong, Y., & Liu, F. (2016) · Automatica · doi:10.1016/j.automatica.2016.08.007 · Cited by 478
Self-citationAn Inertial Forward-Backward Algorithm for Monotone Inclusions
Lorenz, D. A., & Pock, T. (2015) · Journal of Mathematical Imaging and Vision · doi:10.1007/s10851-014-0523-2 · Cited by 445
A variational perspective on accelerated methods in optimization
Wibisono, A., Wilson, A. C., & Jordan, M. I. (2016) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1614734113 · Cited by 440
Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (2001)
Breese, J. S., & Koller, D. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.4607 · Cited by 428
Convex Optimization, Game Theory, and Variational Inequality Theory
Scutari, G., Palomar, D., Facchinei, F., & Pang, J.-S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936021 · Cited by 376
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
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
Self-citationDistributed 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-citationA Proximal Gradient Algorithm for Decentralized Composite Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2461520 · Cited by 307
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
Numerical Solutions to Nash–Cournot Equilibria in Coupled Constraint Electricity Markets
Contreras, J., Klusch, M., & Krawczyk, J. B. (2004) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2003.820692 · Cited by 287
Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
Attouch, H., Chbani, Z., Peypouquet, J., & Redont, P. (2018) · Mathematical Programming · doi:10.1007/s10107-016-0992-8 · Cited by 277
Splitting Methods in Communication, Imaging, Science, and Engineering
(2016) · Scientific Computation · doi:10.1007/978-3-319-41589-5 · Cited by 259
Dynamic Control of Agents Playing Aggregative Games With Coupling Constraints
Grammatico, S. (2017) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2017.2672902 · Cited by 212
Convergence Rate Analysis of Several Splitting Schemes
Davis, D., & Yin, W. (2016) · Scientific Computation · doi:10.1007/978-3-319-41589-5_4 · Cited by 206
Primal–dual algorithm for distributed constrained optimization
Lei, J., Chen, H.-F., & Fang, H. (2016) · Systems & Control Letters · doi:10.1016/j.sysconle.2016.07.009 · Cited by 135
Distributed consensus over digital networks with limited bandwidth and time-varying topologies
Li, T., & Xie, L. (2011) · Automatica · doi:10.1016/j.automatica.2011.05.017 · Cited by 134
Distributed robust adaptive equilibrium computation for generalized convex games
Zhu, M., & Frazzoli, E. (2015) · Automatica · doi:10.1016/j.automatica.2015.10.012 · Cited by 127
Network Games: Theory, Models, and Dynamics
Menache, I., & Ozdaglar, A. (2011) · Synthesis lectures on communication networks · doi:10.2200/s00330ed1v01y201101cnt009 · Cited by 121
Arora, J. S. (2007) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812779670_0001 · Cited by 101
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
A generic online acceleration scheme for optimization algorithms via relaxation and inertia
Iutzeler, F., & Hendrickx, J. M. (2017) · Optimization methods & software · doi:10.1080/10556788.2017.1396601 · Cited by 88
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 60
Self-citationCournot competition in networked markets
Bimpikis, K., Ehsani, S., & İlkılıç, R. (2014) · doi:10.1145/2600057.2602882 · Cited by 54
A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
Rosasco, L., Villa, S., & Vũ, B. C. (2016) · Optimization · doi:10.1080/02331934.2015.1127371 · Cited by 33
Distributed Nash equilibrium seeking by gossip in games on graphs
Salehisadaghiani, F., & Pavel, L. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7799208 · Cited by 9
Self-citation
Cited by
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
Self-citation
Metadata
- Authors
- Yi, P., & Pavel, L.
- Venue
- Automatica
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 102
- Pages
- 111-121
- ISSN
- 0005-1098 (ISSN-L)
- OpenAlex
- W2604966640
- Cited by
- 271
- References
- 43
- FWCI
- 17.90
- 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.