Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

On solution of constraint matrix games under rough interval approach
El-Saeed Ammar, M. G. Brikaa
Granular Computing (2018) Vol. 4, Iss. 3, pp. 601-614
Closed Access | Times Cited: 11

Showing 11 citing articles:

Solution of matrix games with rough interval pay‐offs and its application in the telecom market share problem
Mijanur Rahaman Seikh, Shibaji Dutta, Deng‐Feng Li
International Journal of Intelligent Systems (2021) Vol. 36, Iss. 10, pp. 6066-6100
Open Access | Times Cited: 28
Intuitionistic interval-valued hesitant fuzzy matrix games with a new aggregation operator for solving management problem
Ankan Bhaumik, Sankar Kumar Roy
Granular Computing (2019) Vol. 6, Iss. 2, pp. 359-375
Closed Access | Times Cited: 29
Fuzzy Multi-objective Programming Approach for Constrained Matrix Games with Payoffs of Fuzzy Rough Numbers
M. G. Brikaa, Zhoushun Zheng, El-Saeed Ammar
Symmetry (2019) Vol. 11, Iss. 5, pp. 702-702
Open Access | Times Cited: 21
A solution algorithm for finding the best and the worst fuzzy compromise solutions of fuzzy rough linear programming problem with triangular fuzzy rough number coefficients
Gizem Temelcan
Granular Computing (2022) Vol. 8, Iss. 3, pp. 479-489
Closed Access | Times Cited: 9
A novel equilibrium solution concept for intuitionistic fuzzy bi-matrix games considering proportion mix of possibility and necessity expectations
Imran Khan, Aparna Mehra
Granular Computing (2019) Vol. 5, Iss. 4, pp. 461-483
Closed Access | Times Cited: 13
Solving I-fuzzy two person zero-sum matrix games: Tanaka and Asai approach
Deeba R. Naqvi, Abha Aggarwal, Geeta Sachdev, et al.
Granular Computing (2019) Vol. 6, Iss. 2, pp. 399-409
Closed Access | Times Cited: 11
Mehar approach for solving matrix games with triangular dual hesitant fuzzy payoffs
M. G. Brikaa, Zhoushun Zheng, El-Saeed Ammar
Granular Computing (2021) Vol. 7, Iss. 3, pp. 731-750
Closed Access | Times Cited: 7
Solving zero-sum two-person game with triangular fuzzy number payoffs using new fully fuzzy linear programming models
Gaurav Sharma, Sapan Kumar Das, Ganesh Kumar
OPSEARCH (2023) Vol. 60, Iss. 3, pp. 1456-1487
Closed Access | Times Cited: 2
SOLUTION OF A MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM HAVING ROUGH INTERVAL COEFFICIENTS USING ZERO-SUM GAME
Gizem Temelcan
İstanbul Ticaret Üniversitesi Fen Bilimleri Dergisi (2024) Vol. 23, Iss. 45, pp. 97-113
Open Access
Nash Equilibrium in Fuzzy Random Bi-Matrix Games
Farida Achemine, Moussa Larbani
International Journal of Uncertainty Fuzziness and Knowledge-Based Systems (2023) Vol. 31, Iss. 06, pp. 1005-1031
Closed Access | Times Cited: 1
Optimal Solutions for Constrained Bimatrix Games with Payoffs Represented by Single-Valued Trapezoidal Neutrosophic Numbers
Mohamed Gaber, Majed Alharbi, Abd Alwahed Dagestani, et al.
Journal of Mathematics (2021) Vol. 2021, pp. 1-13
Open Access | Times Cited: 3
Page 1

Scroll to top