MétaCan
Menu
Back to cohort
Record W207600436 · doi:10.5555/2557696.2557709

An efficient approach to solving the agent training problem for a sustainable group

2013· article· en· W207600436 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

VenueSummer Computer Simulation Conference · 2013
Typearticle
Languageen
FieldPsychology
TopicTeam Dynamics and Performance
Canadian institutionsLaurentian UniversityNipissing University
Fundersnot available
KeywordsIBMGroup (periodic table)Computer scienceTask (project management)Assignment problemMathematical optimizationProcess (computing)Sustainable developmentOperations researchArtificial intelligenceEngineeringMathematicsSystems engineeringProgramming language

Abstract

fetched live from OpenAlex

Adaptive Collaboration (AC) aims at building a sustainable group that can work well even though the environment and the state of the group change. Initial role assignment or agent training is an important task for a group to be sustainable. There are many variations and different requirements in the process of role assignment. In this paper, an efficient approach is proposed to solve the problem of agent training for a sustained group. This approach is based on the IBM ILOG CPLEX Optimization Package. The performance is verified by experiments with randomly created groups. The major contribution of this paper is to clarify the problem of initial group role assignment for a sustainable group and propose an efficient and practical solution.

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: none
Teacher disagreement score0.777
Threshold uncertainty score0.509

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.069
GPT teacher head0.323
Teacher spread0.254 · 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