The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Cooperative Control and Potential Games
Abstract
We present a view of cooperative control using the language of learning in games. We review the game-theoretic concepts of potential and weakly acyclic games, and demonstrate how several cooperative control problems, such as consensus and dynamic sensor coverage, can be formulated in these settings. Motivated by this connection, we build upon game-theoretic concepts to better accommodate a broader class of cooperative control problems. In particular, we extend existing learning algorithms to accommodate restricted action sets caused by the limitations of agent capabilities and group-based decision making. Furthermore, we also introduce a new class of games called sometimes weakly acyclic games for time-varying objective functions and action sets, and provide distributed algorithms for convergence to an equilibrium.
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
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 1×
“Several papers study different interaction models and analyze the conditions that lead to consensus [2, 3, 4, 5, 6, 7, 8, 9].”
BackgroundConsensus 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×
“To achieve average consensus, the consensus algorithm of (1) requires that the interaction graph is connected and that the associated weighting matrix Ω = {ωij}Pi,Pj∈P is doubly stochastic [6].”
BackgroundCoordination 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
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
Cooperative Multi-Agent Learning: The State of the Art
Panait, L., & Luke, S. (2005) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-005-2631-2 · Cited by 1,237
Cited by
Saad, W., Han, Z., Poor, H., & Basar, T. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2186410 · Cited by 891
A systems and control perspective of CPS security
Dibaji, S. M., Pirani, M., Flamholz, D. B., Annaswamy, A. M., Johansson, K. H., & Chakrabortty, A. (2019) · Annual Reviews in Control · doi:10.1016/j.arcontrol.2019.04.011 · Cited by 559
A Game-Theoretical Approach for User Allocation in Edge Computing Environment
He, Q., Cui, G., Zhang, X., Chen, F., Deng, S., Jin, H., Li, Y., & Yang, Y. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2019.2938944 · Cited by 398
Modeling, Analysis and Control of Networked Evolutionary Games
Cheng, D., He, F., Qi, H., & Xu, T. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2404471 · Cited by 373
Revisiting log-linear learning: Asynchrony, completeness and payoff-based implementation
Marden, J. R., & Shamma, J. S. (2012) · Games and Economic Behavior · doi:10.1016/j.geb.2012.03.006 · Cited by 301
Self-citation
Metadata
- Authors
- Marden, J. R., Arslan, G., & Shamma, J. S.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
- Published
- 2009-12
- Volume
- 39
- Issue
- 6
- Pages
- 1393-1407
- ISSN
- 1083-4419 (ISSN-L)
- OpenAlex
- W2103151730
- Cited by
- 544
- References
- 5
- FWCI
- 32.47
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Cooperative Control and Potential Games. https://app.cochat.ai/papers/10.1109/tsmcb.2009.2017273
- The paper
- Marden, J. R., Arslan, G., & Shamma, J. S. (2009). Cooperative Control and Potential Games. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). https://doi.org/10.1109/tsmcb.2009.2017273
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.
