Near-Nash Strategies in Competitive Multi-Team Target Assignment

While the Nash equilibrium represents an important strategy concept for non-cooperative scenarios such as military combat, it is often difficult to justify its use in scenarios in which its computation is unfeasible or its existence cannot be guaranteed. To justify the use of Nash-like strategies in such applications, we extend the concept of a Nash equilibrium to encompass a definition of near-Nash strategies. We then employ this definition in an efficient algorithm designed to calculate target assignment strategies in the Multi-Team Dynamic Weapon Target Assignment problem. Using this approach we demonstrate that our concept of near-Nash strategies generates results similar to those produced using the exact Nash strategies.Copyright © 2005 by ASME