Scholarlink

<p>This paper is concerned with the selection and computation of perfect pairwise stable networks, introduced in Bich and Teteryatnikova (<CitationRef CitationID="CR4">2023</CitationRef>) as a refined notion of pairwise stable networks. We reformulate the concept of perfect pairwise stability as a trembling-hand perfect equilibrium of a non-cooperative game played by the links in the network. We adapt a variant of linear tracing procedure for non-cooperative games to the network formation game. We apply the algorithm to several models in the literature and obtain a number of novel insights.</p>

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

Computing Perfect Pairwise Stable Networks

  • 期刊论文

  • 发表日期：

    2025年5月16日

查看全文
  • Caihua Chen,
  • Peixuan Li,
  • Junhao Tao,
  • Yang Zhan

摘要

This paper is concerned with the selection and computation of perfect pairwise stable networks, introduced in Bich and Teteryatnikova (2023) as a refined notion of pairwise stable networks. We reformulate the concept of perfect pairwise stability as a trembling-hand perfect equilibrium of a non-cooperative game played by the links in the network. We adapt a variant of linear tracing procedure for non-cooperative games to the network formation game. We apply the algorithm to several models in the literature and obtain a number of novel insights.