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
DOI10.1016/j.ins.2022.02.025OpenAlexW4212839613WikidataQ113872297 ScholiaQ113872297MaRDI QIDQ6118650
Qing-Xian Wu, Mou Chen, Yuhui Wang, Shouyi Li
Publication date: 28 February 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2022.02.025
Convex programming (90C25) Automated systems (robots, etc.) in control theory (93C85) Games with infinitely many players (91A07) Multi-agent systems (93A16) Algorithmic game theory and complexity (91A68)
Cites Work
- Unnamed Item
- Unnamed Item
- Another efficient algorithm for convex hulls in two dimensions
- An application of dynamic Nash task assignment strategies to multi-team military air operations.
- Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method
- Regularized least squares locality preserving projections with applications to image recognition
- A model of river pollution as a dynamic game with network externalities
- A reinforcement learning approach for dynamic multi-objective optimization
- Estimating priorities from relative deviations in pairwise comparison matrices
- Heterogeneous formation control of multiple rotorcrafts with unknown dynamics by reinforcement learning
- Game theory for automated maneuvering during air-to-air combat
- Settling the complexity of computing two-player Nash equilibria
- The quickhull algorithm for convex hulls
- Game Theory
- Distributed Learning Over Networks: Effect of Using Historical Observations
This page was built for publication: 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
