MétaCan
Menu
Back to cohort

Graphon Field Tracking Games with Discrete Time Q-noise

2023· article· en· W4391020013 on OpenAlexaff
Alex Dunyak, Peter E. Caines

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicStochastic processes and statistical mechanics
Canadian institutionsMcGill University
Fundersnot available
KeywordsDiscrete time and continuous timeLimit (mathematics)Nash equilibriumNoise (video)Quadratic equationBrownian motionGraphBrownian noiseComputer scienceMathematicsControl theory (sociology)Discrete mathematicsMathematical optimizationMathematical analysisControl (management)White noise

Abstract

fetched live from OpenAlex

Linear quadratic games on very large dense networks can be modelled with discrete time linear quadratic graphon field games with Q-noise. In such a game, each node in the graph corresponds to an agent weakly connected via an undirected network, with a correlated Brownian disturbance affecting each agent. The limit of the finite-sized linear quadratic network tracking game in discrete time is formulated, and it is shown that under the proper assumptions, the game has a graphon limit system with Q-noise. Then, the optimal control of the discrete time system is found in closed-form and the Nash equilibrium behavior of the game is numerically demonstrated.

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.

How this classification was reachedexpand

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.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.925
Threshold uncertainty score0.592

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
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.0010.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.031
GPT teacher head0.310
Teacher spread0.279 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicStochastic processes and statistical mechanicsFrench-language works237,207