首页> 外文期刊>IEEE Transactions on Aerospace and Electronic Systems >Effectiveness of the Nash strategies in competitive multi-team target assignment problems
【24h】

Effectiveness of the Nash strategies in competitive multi-team target assignment problems

机译:纳什策略在竞争性多团队目标分配问题中的有效性

获取原文
获取原文并翻译 | 示例
           

摘要

The Nash strategy in game theory has often been criticized as being ineffective in competitive multi-team target assignment problems, especially when compared with other simplistic strategies such as the random or greedy targeting strategies. This criticism arises from the fact that the Nash strategies may yield unpredictable results when paired with non-Nash strategies in non-zero sum games. In addition, the Nash equilibrium is generally more difficult to compute than strategies which do not attempt to anticipate the strategy of the other side. The authors seek to show that in multi-team target assignment problems the Nash strategy is superior to such simplistic strategies while also remaining computationally feasible. To demonstrate this point, an attrition model was considered, consisting of two teams of nonhomogeneous fighting units simultaneously targeting each other and compare the outcomes when various combinations of four targeting strategies are used on each side. The four strategies are: 1) the random strategy where each unit selects its target randomly, 2) the unit greedy strategy where each unit chooses the target that optimizes its own performance only, 3) the team optimal strategy where the units coordinate their choice of targets so as to optimize the overall team performance while ignoring the possible strategy choices by the other team, and 4) the team Nash strategy, calculated under the assumption that the other team is also using a Nash strategy. Because the computational requirements for calculating the team Nash strategies may become unfeasibly large, an efficient method was discussed for approximating the Nash strategies using a neighborhood search algorithm called unit level team resource allocation (ULTRA). The results were compared for all 16 possible combinations of these four targeting strategies and show that for each team the Nash strategy outperforms all other strategies irrespective of the strategy employed by the other team
机译:博弈论中的纳什策略经常被批评为在竞争性多团队目标分配问题上无效,尤其是与其他简单策略(例如随机或贪婪的目标策略)相比时。这种批评源于以下事实:在非零和博弈中,纳什策略与非纳什策略配对可能会产生不可预测的结果。此外,纳什均衡通常比不尝试预测另一方策略的策略更难计算。作者试图证明,在多团队目标分配问题中,纳什策略优于此类简单策略,同时在计算上仍然可行。为了证明这一点,我们考虑了一个耗损模型,该模型由两支同时攻击对方的非同质战斗部队组成,并且在双方使用四种瞄准策略的各种组合时比较了结果。四种策略是:1)每个单元随机选择其目标的随机策略; 2)每个单元选择仅优化自身性能的目标的单元贪婪策略; 3)各个单元协调其选择的团队最优策略目标,以优化整体团队绩效,同时忽略另一个团队可能选择的策略,以及4)团队Nash策略,该假设是在另一个团队也使用Nash策略的情况下计算得出的。由于计算团队Nash策略的计算需求可能变得不可行,因此,讨论了一种使用称为单元级团队资源分配(ULTRA)的邻域搜索算法近似Nash策略的有效方法。比较了这四种定向策略的所有16种可能组合的结果,结果表明,对于每个团队,纳什策略均胜过所有其他策略,而与另一团队采用的策略无关

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号