An algorithm for finding approximate Nash equilibria in bimatrix games

DOI10.1007/s00500-020-05213-yzbMath1491.91008OpenAlexW3047980634MaRDI QIDQ2157005

Lun Shan Gao

Publication date: 21 July 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-020-05213-y

zbMATH Keywords

possibility distributionfuzzificationtriangular fuzzy numberapproximate NENash equilibria (NE)

Mathematics Subject Classification ID

Noncooperative games (91A10) 2-person games (91A05) Algorithmic game theory and complexity (91A68) Game theory and fuzziness (91A86)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximate well-supported Nash equilibria below two-thirds
• Fundamentals of parameterized complexity
• Nash equilibrium strategy for fuzzy non-cooperative games
• Fuzzy mathematical programming and fuzzy matrix games
• Linear programming models and methods of matrix games with payoffs of triangular fuzzy numbers
• A note on approximate Nash equilibria
• New algorithms for approximate Nash equilibria in bimatrix games
• Non cooperative fuzzy games in normal form: a survey
• Fuzzy numbers
• The fuzzy arithmetic mean
• On the use of the ranking function approach to solve fuzzy matrix games in a direct way
• Fuzzy sets as a basis for a theory of possibility
• SOLUTION CONCEPT FOR A NON-COOPERATIVE GAME WITH FUZZY PARAMETERS
• Settling the complexity of computing two-player Nash equilibria
• Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
• Fuzzy and multiobjective games for conflict resolution

This page was built for publication: An algorithm for finding approximate Nash equilibria in bimatrix games