Scholarlink

<p>In this paper, we study finite-agent linear-quadratic games on graphs. Specifically, we propose a comprehensive framework that extends the existing literature by incorporating heterogeneous and interpretable player interactions. Compared to previous works, our model offers a more realistic depiction of strategic decision-making processes. For general graphs, we establish the convergence of fictitious play, a widely-used iterative solution method for determining the Nash equilibrium of our proposed game model. Notably, under appropriate conditions, this convergence holds true irrespective of the number of players involved. For vertex-transitive graphs, we develop a semi-explicit characterization of the Nash equilibrium. Through rigorous analysis, we demonstrate the well-posedness of this characterization under certain conditions. We present numerical experiments that validate our theoretical results and provide insights into the intricate relationship between various game dynamics and the underlying graph structure.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Finite-Agent Stochastic Differential Games on Large Graphs: I. The Linear-Quadratic Case

  • 期刊论文

  • 发表日期：

    2025年9月3日

查看全文
  • Ruimeng Hu,
  • Jihao Long,
  • Haosheng Zhou

摘要

In this paper, we study finite-agent linear-quadratic games on graphs. Specifically, we propose a comprehensive framework that extends the existing literature by incorporating heterogeneous and interpretable player interactions. Compared to previous works, our model offers a more realistic depiction of strategic decision-making processes. For general graphs, we establish the convergence of fictitious play, a widely-used iterative solution method for determining the Nash equilibrium of our proposed game model. Notably, under appropriate conditions, this convergence holds true irrespective of the number of players involved. For vertex-transitive graphs, we develop a semi-explicit characterization of the Nash equilibrium. Through rigorous analysis, we demonstrate the well-posedness of this characterization under certain conditions. We present numerical experiments that validate our theoretical results and provide insights into the intricate relationship between various game dynamics and the underlying graph structure.