MétaCan
Menu
Back to cohort

On linear quadratic potential games

2025· article· en· W4415183496 on OpenAlexafffund
Sara Hosseinirad, Giulio Salizzoni, Alireza Alian Porzani, Maryam Kamgarpour

Bibliographic record

VenueAutomatica · 2025
Typearticle
Languageen
FieldDecision Sciences
TopicGame Theory and Applications
Canadian institutionsUniversity of British Columbia
FundersNatural Sciences and Engineering Research Council of CanadaSchweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
KeywordsNash equilibriumPotential gameAction (physics)Class (philosophy)Convergence (economics)Quadratic equationBest responseSet (abstract data type)

Abstract

fetched live from OpenAlex

Our paper addresses characterizing conditions for linear quadratic (LQ) games to be potential. The desired properties of potential games in finite action settings, such as convergence of learning dynamics to Nash equilibria and challenges of learning Nash equilibria in continuous state and action settings, motivate us to characterize LQ potential games. Our first contribution is to consider two-player LQ games with full-state feedback and scalar states and action space, and to analytically verify that the set of potential games within this example is limited, essentially differing only slightly from an identical interest game. Given this finding, we restrict the class of LQ games to those with decoupled dynamics and decoupled state linear feedback information structure. For this subclass, we show that the set of potential games strictly includes non-identical interest games and characterize conditions for LQ games in this subclass to be potential. We further derive their corresponding potential function and prove the existence of a Nash equilibrium. Meanwhile, we highlight the challenges in characterizations of the Nash equilibrium for this class of potential LQ games, theoretically and through simulation.

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.001
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.244
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.002
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.000
Insufficient payload (model declined to judge)0.0010.006

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.040
GPT teacher head0.403
Teacher spread0.363 · 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; both teacher heads agree on what is shown here.

Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueAutomaticaSame topicGame Theory and ApplicationsFrench-language works237,207