A clustering coefficient network formation game

DOI10.1007/978-3-642-24829-0_21zbMATH Open1233.91066arXiv1010.1561OpenAlexW2115927996MaRDI QIDQ3095276FDOQ3095276

Authors: Michael Brautbar, Michael Kearns 

Publication date: 28 October 2011

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Abstract: For the most up-to-date version please visit http://www.cis.upenn.edu/~brautbar/ccgame.pdf

Full work available at URL: https://arxiv.org/abs/1010.1561

Recommendations

• The Price of Anarchy in Network Creation Games Is (Mostly) Constant
• The price of anarchy in network creation games is (mostly) constant
• Topological price of anarchy bounds for clustering games on networks
• The price of selfish behavior in bilateral network formation
• The price of anarchy in cooperative network creation games

Mathematics Subject Classification ID

Applications of game theory (91A80) Games involving graphs (91A43)

Cited In (10)

• On non-cooperativeness in social distance games
• Equilibria and efficiency loss in games on networks
• Topological price of anarchy bounds for clustering games on networks
• The complexity of rationalizing network formation
• Bounded budget connection (BBC) games or how to make friends and influence people, on a budget
• Signed network formation games and clustering balance
• The price of anarchy in network creation games is (mostly) constant
• Formation of stable and efficient social storage cloud
• Tree Nash equilibria in the network creation game
• A unified framework for strong price of anarchy in clustering games

This page was built for publication: A clustering coefficient network formation game

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