Complexity and stochastic evolution of dyadic networks

DOI10.1016/J.COR.2004.06.006MaRDI QIDQ2567162zbMATH OpenOpenAlexFDO

Authors Richard Baron, Jacques Durieu, Philippe Solal, Hans Haller

Publication date 29 September 2005

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2004.06.006

zbMATH Keywords

game theorynetwork formationNP-hardnesspotential gamesstochastic stability

Mathematics Subject Classification ID

Probabilistic measure theory (60A10) Stochastic network models in operations research (90B15) Stochastic games, stochastic differential games (91A15) Evolutionary games (91A22) Games involving graphs (91A43)

Recommendations

• Nash networks with heterogeneous links
• Network formation and stable equilibrium
• Good neighbors are hard to find: Computational complexity of network formation
• A Noncooperative Model of Network Formation
• Networks and stability

Cites work

• A Noncooperative Model of Network Formation
• A Shapley value representation of potential games
• A strategic model of social and economic networks
• Control costs and potential functions for spatial games
• Graphs and Cooperation in Games
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Large random graphs in pseudo-metric spaces
• Potential games
• Potential maximizers and network formation
• Probabilistic choice and procedurally bounded rationality
• The Planar Hamiltonian Circuit Problem is NP-Complete
• The statistical mechanics of strategic interaction

Cited in

(12)

• Co-authorship model with link strength
• Nonspecific networking
• Communication network formation with link specificity and value transferability
• Network potentials
• The micro-macro link for the theory of structural balance
• Heuristic decision making in network linking
• The game-theoretical modelling of a dynamically evolving network: revisiting the target sequence 111
• Nash equilibria of network formation games under consent
• Network extension
• Stability in the self-organized evolution of networks
• Egoist's dilemma with interval data
• Good neighbors are hard to find: Computational complexity of network formation

This page was built for publication: Complexity and stochastic evolution of dyadic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567162)