MétaCan
Menu
Back to cohort
Record W1583215525

Supply network protection under capacity constraint

2013· article· en· W1583215525 on OpenAlex
Naji Bricha, Mustapha Nourelfath

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 Conference on Industrial Engineering and Systems Management · 2013
Typearticle
Languageen
FieldEngineering
TopicInfrastructure Resilience and Vulnerability Analysis
Canadian institutionsUniversité Laval
Fundersnot available
KeywordsContext (archaeology)Constraint (computer-aided design)Computer scienceGame theorySupply chainFacility location problemComputer securityOperations researchCapacity planningMicroeconomicsBusinessEngineeringEconomics
DOInot available

Abstract

fetched live from OpenAlex

This Critical Supply network can be victim of different threats such as intentional attacks. It has become extremely important to protect critical supply chain facilities against intentional attacks. This article develops a game-theoretical model to deal with the protection of facilities, in the context of the capacitated fixed-charge location and capacity acquisition problem. Using a game theoretical model, a method is developed to evaluate the utilities of the players (i.e., the defender and the attacker). The model considers a non-cooperative two-period game between the players, and an algorithm is presented to determine the equilibrium solution and the optimal defence strategy under capacity constraints. The approach is compared to other suggested strategies to provide managerial insights in the context of facility location and with the possibility of using extra-capacities.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
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.241
Threshold uncertainty score0.652

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.045
GPT teacher head0.218
Teacher spread0.173 · 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