Categories
- Indexing & Abstracting
- Editorial Board
- Submit Manuscript
- Instruction to Author
- Current Issue
- Past Issues
- Special Issue
- Call for papers November 2019
- Ethics and Malpractice
- Conflict of Interest Statement
- Statement of Informed Consent
- Final Proof Correction and Submission
- Publication Ethics
- Peer review process
- Cover image - August 2019
- Index Copernicus ICV 2016
- Quick Response - Contact Us
CALL FOR PAPERS
Author Information
CERTIFICATE
IMPACT FACTOR 2018
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
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:
Announcement
IJMCE RECOMMENDATION
ONLINE PAYPAL PAYMENT
CURRENT ISSUE
NEWS
CHIEF EDITOR
Rosane Cavalcante Fragoso, Brasil
ASSOCIATE CHIEF EDITOR
Jean-Marc SABATIER
Chief Scientific Officer and Head of a Research Group
France
Monthly archive
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- 1 of 4
- ››
Advantages of IJCR
- Rapid Publishing
- Professional publishing practices
- Indexing in leading database
- High level of citation
- High Qualitiy reader base
- High level author suport
Copyright @ 2010 International Journal Of Current Research. All rights reserved
