An algorithm for finding approximate Nash equilibria in bimatrix games

DOI10.1007/S00500-020-05213-YMaRDI QIDQ2157005zbMATH OpenOpenAlexFDO

Authors 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

approximate NEfuzzificationNash equilibria (NE)possibility distributiontriangular fuzzy number

Mathematics Subject Classification ID

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

Recommendations

• An optimization approach for approximate Nash equilibria
• Polynomial algorithms for approximating Nash equilibria of bimatrix games
• New algorithms for approximate Nash equilibria in bimatrix games
• Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
• Computing exact and approximate Nash equilibria in 2-player games

Cites work

• A note on approximate Nash equilibria
• Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
• Fundamentals of parameterized complexity
• Fuzzy and multiobjective games for conflict resolution
• Fuzzy mathematical programming and fuzzy matrix games
• Fuzzy numbers
• Fuzzy sets as a basis for a theory of possibility
• scientific article; zbMATH DE number 41551 (Why is no real title available?)
• scientific article; zbMATH DE number 1099369 (Why is no real title available?)
• Linear programming models and methods of matrix games with payoffs of triangular fuzzy numbers
• Nash equilibrium strategy for fuzzy non-cooperative games
• New algorithms for approximate Nash equilibria in bimatrix games
• Non cooperative fuzzy games in normal form: a survey
• On the use of the ranking function approach to solve fuzzy matrix games in a direct way
• Settling the complexity of computing two-player Nash equilibria
• SOLUTION CONCEPT FOR A NON-COOPERATIVE GAME WITH FUZZY PARAMETERS
• The fuzzy arithmetic mean

Cited in

(10)

• scientific article; zbMATH DE number 5606343 (Why is no real title available?)
• An alternating direction method for Nash equilibrium of two-person games with alternating offers
• An optimization approach for approximate Nash equilibria
• scientific article; zbMATH DE number 4023062 (Why is no real title available?)
• Fast Algorithms for Rank-1 Bimatrix Games
• Semidefinite Programming and Nash Equilibria in Bimatrix Games
• Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
• Two Algorithms for Computing Exact and Approximate Nash Equilibria in Bimatrix Games
• Finding Nash equilibrium in bimatrix games in zero-error probabilistic polynomial time
• Computing Nash equilibria by iterated polymatrix approximation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2157005)