MétaCan
Menu
Back to cohort
Record W2148731999 · doi:10.1109/icsmc.2009.5346925

Automating nurse self-rostering: A multiagent systems model

2009· article· en· W2148731999 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

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicScheduling and Timetabling Solutions
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceMulti-agent systemHuman–computer interactionArtificial intelligence

Abstract

fetched live from OpenAlex

This paper presents a multiagent systems model for constructing nurse rosters. Over the past decade self-rostering has become more favorable in nursing personnel scheduling, due to its empowerment and motivational benefits. However, the labor intensive negotiation procedure among participants has limited its application to medium sized and large wards. To overcome this limitation, we propose an automated negotiation tool utilizing economic-based negotiation mechanisms. We model the environment as a multiagent system. Nurses can indicate their preferences by configuring the preference profiles of the nurse agents, and the nurse agents collectively construct rosters through the negotiation with the management agents and among themselves. To support the design and implementation of automated self-rostering systems, we present a multiagent systems architecture, a structure of preference information, and a negotiation mechanism.

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.002
metaresearch head score (Gemma)0.001
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.364
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.001

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.158
GPT teacher head0.418
Teacher spread0.260 · 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

Quick stats

Citations10
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicScheduling and Timetabling SolutionsFrench-language works237,207