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
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
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
Augmented distributed optimization for networked systems
Xu, J. (2019) · doi:10.32657/10356/68805 · Cited by 5
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks. https://app.cochat.ai/papers/10.1109/tac.2011.2174678
- The paper
- Stankovic, M. S., Johansson, K. H., & Stipanovic, D. M. (2012). Distributed Seeking of Nash Equilibria With Applications to Mobile Sensor Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2011.2174678
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.