RUS  ENG
Full version
JOURNALS // Contributions to Game Theory and Management // Archive

Contributions to Game Theory and Management, 2010 Volume 3, Pages 104–117 (Mi cgtm79)

This article is cited in 1 paper

One-Way Flow Dynamic Network Formation Games with Coalition-Homogeneous Costs

Hong-wei Gao, Ye-ming Dai, Wen-wen Li, Lin Song, Ting-ting Lv

Qingdao University, College of Mathematics, Ningxia Road, 308, 266071, Qingdao, China

Abstract: We study one-way flow dynamic network formation games with fixed coalition partition via defining coalition-homogeneous costs. Networks are formed by allowing each agent to take local actions, and his principle is to maximize the payoff of his own coalition. We choose B$\&$G function as agents' basic payoff function which induces coalition-agents' B$\&$G function. Under the new principle we provide the theorem of the existence of local Nash network and the theorem of the architecture of local Nash network and its dynamic formation process.

Keywords: network formation games, coalition-homogeneous cost, local Nash networks, coalition-agent.

Language: English



© Steklov Math. Inst. of RAS, 2026