Social disruption games in signed networks

DOI10.1016/j.cnsns.2024.107910MaRDI QIDQ6199710

Maria J. Serna, Xavier Molinero, Fabián Riquelme

Publication date: 21 March 2024

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

zbMATH Keywords

clusterabilitycomputational complexitycooperative gamesigned graphsocial network

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Cooperative games (91A12) Games involving graphs (91A43) Complexity of computation (including implicit computational complexity) (03D15) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The disjoint paths problem in quadratic time
• Forms of representation for simple games: sizes, conversions and equivalences
• A simple algorithm to detect balance in signed graphs
• Frustration-critical signed graphs
• Games on signed graphs
• Estimating the number of weak balance structures in signed networks
• Cooperation through social influence
• Computational Aspects of Cooperative Game Theory
• Power Indices in Spanning Connectivity Games
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• The Complexity of Enumeration and Reliability Problems
• On the Complexity of Cooperative Solution Concepts
• Community Detection and Stochastic Block Models
• On the complexity of problems on simple games

This page was built for publication: Social disruption games in signed networks