MétaCan
Menu
Back to cohort
Record W1544228644

Conflict Resolution in Probabilistic Multi-Agent Systems

2002· article· en· W1544228644 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

VenueThe Florida AI Research Society · 2002
Typearticle
Languageen
FieldComputer Science
TopicBayesian Modeling and Causal Inference
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsProbabilistic logicComputer scienceRedundancy (engineering)Construct (python library)Conflict resolutionBayesian networkCommon knowledge (logic)Knowledge-based systemsKnowledge representation and reasoningArtificial intelligenceMulti-agent systemMachine learningTheoretical computer scienceEpistemic modal logic
DOInot available

Abstract

fetched live from OpenAlex

Knowledge representation in the Multi-agent systems (MAS) can be characterized by Probabilistic Network. Coordination among probabilistic agents can be achieved on account of their common knowledge, while agent can obtain his own knowledge locally and variously. To construct the common knowledge for the MAS, the conflict among local knowledge of all agents has to be identified and resolved. We propose the necessary and sufficient conditions for their knowledge structure. We also address that the redundancy has to be eliminated at the beginning in case of misleading conclusion. An algorithm is suggested to construct the structure of common knowledge in terms of Bayesian DAG.

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.004
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.960
Threshold uncertainty score0.406

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0040.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.248
GPT teacher head0.376
Teacher spread0.128 · 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