The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks
Abstract
We consider the problem of distributed convergence to a Nash equilibrium in a noncooperative game where the players generate their actions based only on online measurements of their individual cost functions, corrupted with additive measurement noise. Exact analytical forms and/or parameters of the cost functions, as well as the current actions of the players may be unknown. Additionally, the players' actions are subject to linear dynamic constraints. We propose an algorithm based on discrete-time stochastic extremum seeking using sinusoidal perturbations and prove its almost sure convergence to a Nash equilibrium. We show how the proposed algorithm can be applied to solving coordination problems in mobile sensor networks, where motion dynamics of the players can be modeled as: 1) single integrators (velocity-actuated vehicles), 2) double integrators (force-actuated vehicles), and 3) unicycles (a kinematic model with nonholonomic constraints). Examples are given in which the cost functions are selected such that the problems of connectivity control, formation control, rendezvous and coverage control are solved in an adaptive and distributed way. The methodology is illustrated through simulations.
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
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
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 4×
“, [14], [25]–[28], [30]–[32], [35]–[38] and references therein).”
BackgroundMethodInfluentialNash, J. (1951) · The Annals of Mathematics · doi:10.2307/1969529 · Cited by 7,002
Nash, J. (1989) · Cournot Oligopoly · doi:10.1017/cbo9780511528231.007 · Cited by 5,595
Dynamic Noncooperative Game Theory
(1982) · Mathematics in Science and Engineering · doi:10.1016/s0076-5392(08)x6169-7 · Cited by 4,057
Monderer, D., & Shapley, L. S. (1996) · Games and Economic Behavior · doi:10.1006/game.1996.0044 · Cited by 3,543
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×
“, [29], [30]) with time-varying gains ( ), so that we can choose standard Lyapunov function applied to these problems (see, e.”
MethodCoverage Control for Mobile Sensing Networks
Cortes, J., Martinez, S., Karatas, T., & Bullo, F. (2004) · IEEE Transactions on Robotics and Automation · doi:10.1109/tra.2004.824698 · Cited by 2,710
Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
Rosen, J. B. (1965) · Econometrica · doi:10.2307/1911749 · Cited by 2,686
Analysis of recursive stochastic algorithms
Ljung, L. (1977) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1977.1101561 · Cited by 1,467
Stochastic Approximation Methods for Constrained and Unconstrained Systems
Kushner, H. J., & Clark, D. S. (1978) · Applied Mathematical Sciences · doi:10.1007/978-1-4684-9352-8 · Cited by 1,459
Real‐Time Optimization by Extremum‐Seeking Control
Ariyur, K. B., & Krstić, M. (2003) · Wiley eBooks · doi:10.1002/0471669784 · Cited by 986
Real-time optimization by extremum-seeking control
(2004) · Choice Reviews Online · doi:10.5860/choice.41-4064 · Cited by 822
Robust Rendezvous for Mobile Autonomous Agents via Proximity Graphs in Arbitrary Dimensions
Cortes, J., Martinez, S., & Bullo, F. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2006.878713 · Cited by 695
On non-local stability properties of extremum seeking control
Tan, Y., Nešić, D., & Mareels, I. (2006) · Automatica · doi:10.1016/j.automatica.2006.01.014 · Cited by 621
Cooperative Control and Potential Games
Marden, J. R., Arslan, G., & Shamma, J. S. (2009) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2009.2017273 · Cited by 544
Decentralized estimation and control of graph connectivity for mobile sensor networks
Yang, P., Freeman, R. A., Gordon, G. J., Lynch, K. M., Srinivasa, S. S., & Sukthankar, R. (2010) · Automatica · doi:10.1016/j.automatica.2009.11.012 · Cited by 430
Stochastic Approximation and Its Applications
Chen, H.-F. (2003) · Kluwer Academic Publishers eBooks · doi:10.1007/b101987 · Cited by 424
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
Intrinsic robustness of the price of anarchy
Roughgarden, T. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536485 · Cited by 319
Mobile Sensor Network Control Using Mutual Information Methods and Particle Filters
Hoffmann, G. M., & Tomlin, C. J. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2034206 · Cited by 311
Young, H. P. (2009) · Games and Economic Behavior · doi:10.1016/j.geb.2008.02.011 · Cited by 286
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
Decentralized optimization, with application to multiple aircraft coordination
Inalhan, G., Stipanovic, D. M., & Tomlin, C. J. (2003) · Proceedings of the 41st IEEE Conference on Decision and Control, 2002. · doi:10.1109/cdc.2002.1184667 · Cited by 261
Self-citationFlocking while preserving network connectivity
Zavlanos, M. M., Jadbabaie, A., & Pappas, G. J. (2007) · 2007 46th IEEE Conference on Decision and Control · doi:10.1109/cdc.2007.4434530 · Cited by 210
Distributed 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
Huang, M., & Manton, J. H. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2009.2036291 · Cited by 180
Zhang, C., Siranosian, A. A., & Krstić, M. (2007) · Automatica · doi:10.1016/j.automatica.2007.03.009 · Cited by 164
Decentralized Parameter Estimation by Consensus Based Stochastic Approximation
Stankovic, S. S., Stanković, M. S., & Stipanović, D. M. (2010) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2010.2076530 · Cited by 153
Collectives and the Design of Complex Systems
Tumer, K., Wolpert, D. H., & Turner, K. (2004) · Springer eBooks · doi:10.1007/978-1-4419-8909-3 · Cited by 148
Bounded control of network connectivity in multi-agent systems
Dimarogonas, D. V., & Johansson, K. H. (2010) · IET Control Theory and Applications · doi:10.1049/iet-cta.2009.0229 · Cited by 132
Self-citationExtremum seeking under stochastic noise and applications to mobile sensors
Stanković, M. S., & Stipanović, D. M. (2010) · Automatica · doi:10.1016/j.automatica.2010.05.005 · Cited by 119
Distributed Motion Constraints for Algebraic Connectivity of Robotic Networks
Schuresko, M., & Cortés, J. (2009) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-009-9328-8 · Cited by 72
Payoff 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
On collective motion in sensor networks: sample problems and distributed algorithms
Ganguli, A., Susca, S., Martínez, S., Bullo, F., & Cortés, J. (2006) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2005.1582828 · 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
Distributed coverage games for mobile visual sensors (I): Reaching the set of Nash equilibria
Zhu, M., & Martı́nez, S. (2009) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2009.5399545 · Cited by 30
Nash equilibrium seeking in multi-vehicle systems : A Lie bracket approximation-based approach
Dürr, H.-B., Stanković, M. S., & Johansson, K. H. (2012) · Cited by 6
Self-citation
Cited by
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
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: A gossip-based algorithm
Salehisadaghiani, F., & Pavel, L. (2016) · Automatica · doi:10.1016/j.automatica.2016.06.004 · Cited by 309
Designing 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
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
Metadata
- Authors
- Stankovic, M. S., Johansson, K. H., & Stipanovic, D. M.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2012-04
- Volume
- 57
- Issue
- 4
- Pages
- 904-919
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2128658178
- Cited by
- 358
- References
- 39
- FWCI
- 17.87
- 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.