Information-sharing in social networks
From MaRDI portal
Publication:2437849
Recommendations
Cites work
- A strategic model of social and economic networks
- College Admissions and the Stability of Marriage
- Core in a simple coalition formation game
- Defective coloring revisited
- Every Planar Map is Four Colorable
- Graphs and Cooperation in Games
- scientific article; zbMATH DE number 5541960 (Why is no real title available?)
- scientific article; zbMATH DE number 49749 (Why is no real title available?)
- On a network creation game
- On acyclic colorings of graphs on surfaces
- On the Complexity of Cooperative Solution Concepts
- Partitioning into graphs with only small components
- Public goods in networks
- Resale-proofness and coalition-proof Nash equilibria
- Simple priorities and core stability in hedonic games
- Social and economic networks.
- Stability and segregation in group formation
- Stable networks
- Stable payoffs in resale-proof trades of information
- Strongly stable networks
- The price of selfish behavior in bilateral network formation
- The stability of hedonic coalition structures
Cited in
(20)- Privacy-conscious information diffusion in social networks
- Non-existence of stable social groups in information-driven networks
- Sharing information in web communities
- Enhanced models for privacy and utility in continuous-time diffusion 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
- scientific article; zbMATH DE number 6389581 (Why is no real title available?)
- A Relational View of Information Seeking and Learning in Social Networks
- A model for assessing the risk of revealing shared secrets in social networks
- Power law public goods game for personal information sharing in news commentaries
- How long does it take for all users in a social network to choose their communities?
- Clustering on \(k\)-edge-colored graphs
- Loss of information in feedforward social networks
- Improved approximations for the max \(k\)-colored clustering problem
- Staying safe and visible via message sharing in online social networks
- A 0.3622-approximation algorithm for the maximum \(k\)-edge-colored clustering problem
- Access and Sharing Contents Through the Social Network: A POMDP Approach
- Precise dissemination of e-commerce information and behavior of social media users
- Club formation by rational sharing: Content, viability and community structure
This page was built for publication: Information-sharing in social networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437849)