2014/05/01 by Noémi Gaskó, Gaskó, Noémi, Rodica Ioana Lung +3
Computer Science · Decision Sciences · Economics, Econometrics and Finance · #Artificial Intelligence in Games #Computer Science and Game Theory (cs.GT) #Economic theories and models #FOS: Computer and information sciences #Game Theory and Applications #cs.GT
paper · pdf · doi:10.48550/arxiv.1405.0108
openalex publication_date 2014/05/01 · arxiv created 2014/08/28 · arxiv updated 2014/08/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An heuristic approach to compute strong Nash (Aumann) equilibria is presented. The method is based on differential evolution and three variants of a generative relation for strong Nash equilibria characterization. Numerical experiments performed on the minimum effort game for up to 150 players illustrate the efficiency of the approach. The advantages and disadvantages of each variant is discussed in terms of precision and running time.