MétaCan
Menu
Back to cohort
Record W2276034082 · doi:10.3233/ifs-151640

Modified difference-index based ranking bilinear programming approach to solving bimatrix games with payoffs of trapezoidal intuitionistic fuzzy numbers

2015· article· en· W2276034082 on OpenAlex
Tina Verma, Amit Kumar, SS Appadoo

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Intelligent & Fuzzy Systems · 2015
Typearticle
Languageen
FieldDecision Sciences
TopicMulti-Criteria Decision Making
Canadian institutionsUniversity of Manitoba
FundersDepartment of Science and Technology, Ministry of Science and Technology, India
KeywordsRanking (information retrieval)MathematicsBilinear interpolationMathematical optimizationFuzzy logicApplied mathematicsComputer scienceArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Abstract Li and Yang [D.F. Li and J. Yang, A difference-index based ranking bilinear programming approach to solving bimatrix games with payoffs of trapezoidal intuitionistic fuzzy numbers, Journal of Applied Mathematics 2013 (2013), 1–10] pointed out that there is no method in the literature for solving such bimatrix games in which payoffs are represented by intuitionistic fuzzy numbers and proposed a method for the same. In this paper, it is pointed out that Li and Yang have considered some mathematical incorrect assumptions in their proposed method. For resolving the shortcomings of Li and Yang’s method, a new method (named as Mehar method) is proposed. Also, the exact optimal solution of the numerical problem, solved by Li and Yang by their proposed method, is obtained by the proposed Mehar method.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.011
metaresearch head score (Gemma)0.005
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.599
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0110.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.000
Bibliometrics0.0020.002
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.169
GPT teacher head0.376
Teacher spread0.206 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it