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

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.