The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Designing Games for Distributed Optimization
Abstract
The central goal in multiagent systems is to design local control laws for the individual agents to ensure that the emergent global behavior is desirable with respect to a given system level objective. Ideally, a system designer seeks to satisfy this goal while conditioning each agent's control law on the least amount of information possible. This paper focuses on achieving this goal using the field of game theory. In particular, we derive a systematic methodology for designing local agent objective functions that guarantees (i) an equivalence between the resulting Nash equilibria and the optimizers of the system level objective and (ii) that the resulting game possesses an inherent structure that can be exploited in distributed learning, e.g., potential games. The control design can then be completed utilizing any distributed learning algorithm which guarantees convergence to a Nash equilibrium for the attained game structure. Furthermore, in many settings the resulting controllers will be inherently robust to a host of uncertainties including asynchronous clock rates, delays in information, and component failures.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
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 1×
“[23]–[28], consensus based methods [2], [3], [29], [30], or two-”
MethodCoordination of groups of mobile autonomous agents using nearest neighbor rules
Jadbabaie, A., Lin, J., & Morse, A. S. (2003) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2003.812781 · Cited by 8,339
17. A Value for n-Person Games
Shapley, L. S. (1953) · Contributions to the Theory of Games (AM-28), Volume II · doi:10.1515/9781400881970-018 · Cited by 6,950
Shapley, L. S. (1988) · The Shapley Value · doi:10.1017/cbo9780511528446.003 · Cited by 4,954
Monderer, D., & Shapley, L. S. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0044 · Cited by 3,543
Shapley, L. S. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.10.1095 · Cited by 2,382
Nonlinear Programming: Theory and Algorithms
Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2006) · Wiley eBooks · doi:10.1002/0471787779 · Cited by 2,369
(2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800481 · Cited by 2,303
Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Tsitsiklis, J., Bertsekas, D., & Athans, M. (1986) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1986.1104412 · Cited by 1,967
Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria
Nisan, N., Roughgarden, T., Eva Tardos, D., & Vazirani, V. V. (2007) · Cited by 1,154
Algorithmic Game Theory: Computing in Games
Nisan, N., Roughgarden, T., Eva Tardos, D., & Vazirani, V. V. (2007) · Cited by 1,153
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
Strategic Learning and its Limits
Young, H. P. (2004) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199269181.001.0001 · Cited by 605
On Distributed Averaging Algorithms and Quantization Effects
Nedic, A., Olshevsky, A., Ozdaglar, A., & Tsitsiklis, J. N. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2031203 · Cited by 557
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1430343 · Cited by 550
Agreement over random networks
Hatano, Y., & Mesbahi, M. (2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.858670 · Cited by 503
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 Subgradient Methods for Convex Optimization Over Random Networks
Lobel, I., & Ozdaglar, A. (2011) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2091295 · Cited by 351 · cited 2×
“ular, the algorithms presented in [27] and [32] introduce a com-”
MethodResultJoint Strategy Fictitious Play With Inertia for Potential Games
Marden, J. R., Arslan, G., & Shamma, J. S. (2009) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.2010885 · Cited by 317
Self-citationA Convergent Incremental Gradient Method with a Constant Step Size
Blatt, D., Hero, A. O., & Gauchman, H. (2007) · SIAM Journal on Optimization · doi:10.1137/040615961 · Cited by 306
Payoff-Based Dynamics for Multiplayer Weakly Acyclic Games
Marden, J. R., Young, H. P., Arslan, G., & Shamma, J. S. (2009) · SIAM Journal on Control and Optimization · doi:10.1137/070680199 · Cited by 264
Self-citationConvergence and asymptotic agreement in distributed decision problems
Tsitsiklis, J., & Athans, M. (1984) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1984.1103385 · Cited by 247
Marden, J. R. (2012) · Automatica · doi:10.1016/j.automatica.2012.08.037 · Cited by 164
Self-citationAn architectural view of game theoretic control
Gopalakrishnan, R., Marden, J. R., & Wierman, A. (2011) · ACM SIGMETRICS Performance Evaluation Review · doi:10.1145/1925019.1925026 · Cited by 110
Self-citationEquilibrium of Heterogeneous Congestion Control: Existence and Uniqueness
Tang, A., Wang, J., Low, S. H., & Chiang, M. (2007) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.893885 · Cited by 81
A Game-Theoretic Approach to Efficient Power Management in Sensor Networks
Campos-Náñez, E., García, A., & Li, C. (2007) · Operations Research · doi:10.1287/opre.1070.0435 · Cited by 69
EQUILIBRIUM, EVOLUTIONARY STABILITY AND GRADIENT DYNAMICS
Flåm, S. D. (2002) · International Game Theory Review · doi:10.1142/s0219198902000756 · Cited by 64
Designing games for distributed optimization
Li, N., & Marden, J. R. (2011) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2011.6161053 · Cited by 60
Self-citationZhu, M., & Martı́nez, S. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1001.2612 · Cited by 45
Overcoming limitations of game-theoretic distributed control
Marden, J. R., & Wierman, A. (2009) · doi:10.1109/cdc.2009.5400550 · Cited by 39
Self-citationApproaches to asynchronous decentralized decision making
Androulakis, I. P., & Reklaitis, G. V. (1999) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(98)00278-6 · Cited by 38
Designing games to handle coupled constraints
Li, N., & Marden, J. R. (2010) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2010.5718136 · Cited by 37
Self-citationThe Price of Selfishness in Network Coding
Marden, J. R., & Effros, M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2177576 · Cited by 30
Self-citation
Cited by
Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization
Nedic, A., Olshevsky, A., & Rabbat, M. G. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2817461 · Cited by 534
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
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
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 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
Metadata
- Authors
- Li, N., & Marden, J. R.
- Venue
- IEEE Journal of Selected Topics in Signal Processing
- Published
- 2013-04
- Volume
- 7
- Issue
- 2
- Pages
- 230-242
- ISSN
- 1932-4553 (ISSN-L)
- 1941-0484
- OpenAlex
- W1972768959
- Cited by
- 290
- References
- 36
- FWCI
- 26.43
- 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.