CALL FOR PAPERS

Author Information

CERTIFICATE

IMPACT FACTOR 2019

Subject Area

Life Sciences / Biology
Architecture / Building Management
Asian Studies
Business & Management
Chemistry
Computer Science
Economics & Finance
Engineering / Acoustics
Environmental Science
Agricultural Sciences
Pharmaceutical Sciences
General Sciences
Materials Science
Mathematics
Medicine
Nanotechnology & Nanoscience
Nonlinear Science
Chaos & Dynamical Systems
Physics
Social Sciences & Humanities

Why Us? >>

Open Access
Peer Reviewed
Rapid Publication
Life time hosting
Free promotion service
Free indexing service
More citations
Search engine friendly

Plagiarism Detection

IJCR is following an instant policy on rejection those received papers with plagiarism rate of more than 20%. So, All of authors and contributors must check their papers before submission to making assurance of following our anti-plagiarism policies.

An efficient algorithm for finding mixed nash equilibria in 2-player games

Author:

Lunshan (Shaun) GAO

Subject Area:

Physical Sciences and Engineering

Abstract:

This paper presents an algorithm for calculating mixed Nash equilibria in 2-player games. The algorithm is based on the mathematical equivalence between the expected payoff function of bi-matrix games and the fuzzy average. It was proved that the expected payoff function of 2-player games is identical to the fuzzy average of two linguistic values when the payoff matrix is replaced with the consequence matrix, the strategy sets are replaced with term sets in linguistic variables. This paper proves that the new algorithm can compute mixed NE in 2-player games within polynomial time for any types of bi-matrix games. We claim that there is a fully polynomial time scheme for computing mixed NE in 2-player games.

PDF file: