The DOI matches its Crossref record; 29 of the 29 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.
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 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
Monderer, D., & Shapley, L. S. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0044 · Cited by 3,543
Fast linear iterations for distributed averaging
Xiao, L., & Boyd, S. (2004) · Systems & Control Letters · doi:10.1016/j.sysconle.2004.02.022 · Cited by 2,706
Shapley, L. S. (1953) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.39.10.1095 · Cited by 2,382
The Economy as an Evolving Complex System II
Arthur, W. B. (2018) · CRC Press eBooks · doi:10.1201/9780429496639 · Cited by 2,313
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
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
The Statistical Mechanics of Strategic Interaction
Blume, L. E. (1993) · Games and Economic Behavior · doi:10.1006/game.1993.1023 · Cited by 1,402
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
A scheme for robust distributed sensor fusion based on average consensus
Xiao, L., Boyd, S., & Lall, S. (2005) · doi:10.5555/1147685.1147698 · Cited by 1,170
Individual Strategy and Social Structure: An Evolutionary Theory of Institutions
Young, H. P. (1998) · Princeton University Press eBooks · doi:10.1515/9780691214252 · Cited by 1,082
Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations
Shoham, Y., & Leyton-Brown, K. (2008) · doi:10.1017/cbo9780511811654 · Cited by 995
Recent Research in Cooperative Control of Multivehicle Systems
Murray, R. M. (2007) · Journal of Dynamic Systems, Measurement, and Control · doi:10.1115/1.2766721 · Cited by 960
Convergence in Multiagent Coordination, Consensus, and Flocking
Blondel, V. D., Hendrickx, J. M., Olshevsky, A., & Tsitsiklis, J. N. (2006) · Proceedings of the 44th IEEE Conference on Decision and Control · doi:10.1109/cdc.2005.1582620 · Cited by 859
Stability of continuous-time distributed consensus algorithms
Moreau, L. (2004) · 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · doi:10.1109/cdc.2004.1429377 · Cited by 732
A scheme for robust distributed sensor fusion based on average consensus
Xiao, L., Boyd, S., & Lall, S. (2005) · IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005. · doi:10.1109/ipsn.2005.1440896 · Cited by 713
Strategic Learning and its Limits
Young, H. P. (2004) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199269181.001.0001 · Cited by 605
Distributed Control of Robotic Networks
Bullo, F. (2009) · Cited by 588
Fictitious Play Property for Games with Identical Interests
Monderer, D., & Shapley, L. S. (1996) · Journal of Economic Theory · doi:10.1006/jeth.1996.0014 · Cited by 442
Cooperative Control of Distributed Multi‐Agent Systems
(2007) · Wiley eBooks · doi:10.1002/9780470724200 · Cited by 361
Joint 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-citationPayoff-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-citationDistributed control of robotic networks
Pappas, G. J., & Zavlanos, M. M. (2008) · Cited by 140
Marden, J. R., Arslan, G., & Shamma, J. S. (2007) · Adaptive Agents and Multi-Agents Systems · doi:10.1145/1329125.1329175 · Cited by 74
Self-citationPayoff based dynamics for multi-player weakly acyclic games
Marden, J. R., Young, H. P., Arslan, G., & Shamma, J. S. (2007) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2007.4434401 · Cited by 66
Self-citationConsensus with Quantized Information Updates
Kashyap, A., Başar, T., & Srikant, R. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2006.376993 · Cited by 40
Fictitious Play and No-Cycling Conditions *Preprint
Monderer, D., & Sela, A. (1997) · RePEc: Research Papers in Economics · Cited by 33
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
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
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
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
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
- 29
- 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
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.