The complexity of rationalizing network formation

DOI10.1109/FOCS.2009.48MaRDI QIDQ5171214zbMATH OpenFDO

Authors Shankar Kalyanaraman, Christopher Umans

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/FOCS.2009.48

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43) Rationality and learning in game theory (91A26)

Recommendations

• The Complexity of Rationalizing Matchings
• Good neighbors are hard to find: Computational complexity of network formation
• A clustering coefficient network formation game
• Near-optimal network design with selfish agents
• The price of anarchy in network creation games

Cited in

(6)

• Link investment substitutability: a factor influencing network formation
• Network formation under negative degree-based externalities
• Maximising the worth of nascent networks
• A logical study of group-size based social network creation
• Dynamic network formation with foresighted agents
• Inverse game theory: learning utilities in succinct games

This page was built for publication: The complexity of rationalizing network formation

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