An application of dynamic Nash task assignment strategies to multi-team military air operations.

DOI10.1016/S0005-1098(03)00122-5zbMath1153.93469OpenAlexW1997500397MaRDI QIDQ1410378

Yong Liu, Marwan A. Simaan, Cruz, J. B. jun.

Publication date: 14 October 2003

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0005-1098(03)00122-5

zbMATH Keywords

Nash strategiesMilitary operationsTask reassignment

Mathematics Subject Classification ID

Game theory (91A99) Application models in control theory (93C95)

Related Items (3)

A fast algorithm to solve large-scale matrix games based on dimensionality reduction and its application in multiple unmanned combat air vehicles attack-defense decision-making ⋮ Optimizing multi-team system behaviors: insights from modeling team communication ⋮ Autonomous and decentralized mission planning for clusters of UUVs

Cites Work

• On the Stackelberg strategy in nonzero-sum games
• Unnamed Item
• Unnamed Item

This page was built for publication: An application of dynamic Nash task assignment strategies to multi-team military air operations.