Learning, Misspecification, and Cognitive Arbitrage in Linear-Quadratic Network Games

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zhu, Quanyan, Han, Zhengye
Format: Preprint
Published: 2026
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866908896374816768
author Zhu, Quanyan
Han, Zhengye
author_facet Zhu, Quanyan
Han, Zhengye
contents We study strategic interaction in linear-quadratic network games where agents act on subjective, misspecified models of their environment. Agents observe noisy aggregate signals generated by local network externalities and interpret them through simplified conjectures, such as constant or mean-field representations. We characterize the long-run behavior using the Berk-Nash equilibrium (BNE) concept, establishing conditions under which BNE diverges from the Nash equilibrium of the perfectly specified game. We quantify this divergence using a Value of Misspecification (VoM) metric. Building on this framework, we introduce "cognitive arbitrage" -- a design paradigm where a system designer strategically shapes agents' conjectures via minimal observation distortions to steer equilibrium outcomes. We formulate the cognitive arbitrage problem as a Stackelberg optimization with closed-form solutions and prove the convergence of a two-time-scale learning algorithm to the optimal BNE. Our results provide a principled framework for influencing behavior in networked systems with bounded rationality, offering a new perspective on mechanism design that operates on agents' representations rather than their incentives.
format Preprint
id arxiv_https___arxiv_org_abs_2603_17157
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Learning, Misspecification, and Cognitive Arbitrage in Linear-Quadratic Network Games
Zhu, Quanyan
Han, Zhengye
Computer Science and Game Theory
We study strategic interaction in linear-quadratic network games where agents act on subjective, misspecified models of their environment. Agents observe noisy aggregate signals generated by local network externalities and interpret them through simplified conjectures, such as constant or mean-field representations. We characterize the long-run behavior using the Berk-Nash equilibrium (BNE) concept, establishing conditions under which BNE diverges from the Nash equilibrium of the perfectly specified game. We quantify this divergence using a Value of Misspecification (VoM) metric. Building on this framework, we introduce "cognitive arbitrage" -- a design paradigm where a system designer strategically shapes agents' conjectures via minimal observation distortions to steer equilibrium outcomes. We formulate the cognitive arbitrage problem as a Stackelberg optimization with closed-form solutions and prove the convergence of a two-time-scale learning algorithm to the optimal BNE. Our results provide a principled framework for influencing behavior in networked systems with bounded rationality, offering a new perspective on mechanism design that operates on agents' representations rather than their incentives.
title Learning, Misspecification, and Cognitive Arbitrage in Linear-Quadratic Network Games
topic Computer Science and Game Theory
url https://arxiv.org/abs/2603.17157