MétaCan
Menu
Back to cohort

Ranking units in DEA based on efficiency intervals and decision‐maker's preferences

2011· article· en· W2071105072 on OpenAlex

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

VenueInternational Transactions in Operational Research · 2011
Typearticle
Languageen
FieldDecision Sciences
TopicEfficiency Analysis Using DEA
Canadian institutionsLaurentian University
Fundersnot available
KeywordsData envelopment analysisRanking (information retrieval)Decision makerEfficiencyInterval (graph theory)MathematicsSet (abstract data type)StatisticsUpper and lower boundsComputer scienceMathematical optimizationEconometricsOperations researchArtificial intelligenceCombinatorics

Abstract

fetched live from OpenAlex

Abstract Data Envelopment Analysis (DEA) uses the best favorable weight set for the inputs and outputs of each decision‐making unit (DMU) to obtain its best possible score. Hence, this score can be considered as an upper bound of the real efficiency score. If we also use the least favorable weight set of each DMU, then a lower bound of the efficiency score can also be obtained. So, instead of one score, we can find an interval that gives all possible values of the efficiency score for each DMU. The aim of this paper is to propose an approach for determining efficiency intervals and setting up a full ranking of DMUs based on these intervals. We incorporate explicitly the decision‐maker's preferences in two phases. The first phase is for obtaining efficiency intervals, by introducing some restrictions on the input and output weights. The second one is for ranking the intervals based on the combination of the lower and the upper bounds of the efficiency intervals. The developed formulations will be illustrated through some numerical examples.

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.010
metaresearch head score (Gemma)0.006
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.325
Threshold uncertainty score0.997

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0100.006
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0040.004
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0040.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.370
GPT teacher head0.487
Teacher spread0.117 · 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