Boundaries of computational complexity and optimal cluster’s quantity for controlled swarm in non-cooperative games

Author unknown

Open source

DOI
10.18500/0869-6632-2021-29-3-376-385
Published
2021-05-31
Container
Izvestiya VUZ. Applied Nonlinear Dynamics
Publisher
Saratov State University
Open access
unknown

Credibility signals

uncertain Score 58/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.18500/0869-6632-2021-29-3-376-385,
  title = {Boundaries of computational complexity and optimal cluster’s quantity for controlled swarm in non-cooperative games},
  year = {2021},
  journal = {Izvestiya VUZ. Applied Nonlinear Dynamics},
  doi = {10.18500/0869-6632-2021-29-3-376-385},
  url = {https://doi.org/10.18500/0869-6632-2021-29-3-376-385}
}

RIS

TY  - JOUR
TI  - Boundaries of computational complexity and optimal cluster’s quantity for controlled swarm in non-cooperative games
PY  - 2021
JO  - Izvestiya VUZ. Applied Nonlinear Dynamics
DO  - 10.18500/0869-6632-2021-29-3-376-385
UR  - https://doi.org/10.18500/0869-6632-2021-29-3-376-385
ER  - 

APA

Boundaries of computational complexity and optimal cluster’s quantity for controlled swarm in non-cooperative games. (2021). Izvestiya VUZ. Applied Nonlinear Dynamics. https://doi.org/10.18500/0869-6632-2021-29-3-376-385

Source records