MétaCan
Menu
Back to cohort
Record W1496756735

A cooperative game-theoretic measurement allocation algorithm for localization in unattended ground sensor networks

2008· article· en· W1496756735 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 Conference on Information Fusion · 2008
Typearticle
Languageen
FieldComputer Science
TopicDistributed Sensor Networks and Detection Algorithms
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsObservabilityShapley valueCooperative game theoryGame theoryComputer scienceMeasure (data warehouse)Node (physics)Mathematical optimizationProcess (computing)Wireless sensor networkValue (mathematics)AlgorithmMathematicsEngineeringComputer networkData miningMathematical economics
DOInot available

Abstract

fetched live from OpenAlex

This paper proposes a cooperative game-theoretic approach for efficient measurement allocation in unattended ground sensor networks when they are engaged in localizing a target. The game-theoretic approach evolves around the idea that localization is achieved as a result of collaboration among the nodes. Hence this process can be modeled as a cooperative game and the solution concept of the Shapley value can be exploited to determine the value of each node for localization. Furthermore, it is proved that by iteratively allocating measurements according to the Shapley value, stochastic observability-a measure of the predicted level of accuracy in localization-desirably improves.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.985
Threshold uncertainty score0.819

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.002
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.034
GPT teacher head0.255
Teacher spread0.221 · 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