Information-sharing in social networks
From MaRDI portal
Publication:2437849
DOI10.1016/j.geb.2013.10.002zbMath1283.91162MaRDI QIDQ2437849
Katrina Ligett, Jon M. Kleinberg
Publication date: 13 March 2014
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2013.10.002
Related Items
A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem, Clustering on \(k\)-edge-colored graphs, Non-existence of stable social groups in information-driven networks, How long does it take for all users in a social network to choose their communities?, Privacy-constrained network formation, The Parallel Complexity of Coloring Games, Unnamed Item, Improved Approximations for the Max k-Colored Clustering Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The stability of hedonic coalition structures
- Stability and segregation in group formation
- Public goods in networks
- Stable payoffs in resale-proof trades of information
- Resale-proofness and coalition-proof Nash equilibria
- Stable networks
- Partitioning into graphs with only small components
- On acyclic colorings of graphs on surfaces
- Core in a simple coalition formation game
- Simple priorities and core stability in hedonic games
- Strongly stable networks
- A strategic model of social and economic networks
- On a network creation game
- Defective coloring revisited
- Graph coloring with no large monochromatic components
- Every Planar Map is Four Colorable
- Graphs and Cooperation in Games
- On the Complexity of Cooperative Solution Concepts
- The price of selfish behavior in bilateral network formation
- College Admissions and the Stability of Marriage