Social disruption games in signed networks

DOI10.1016/J.CNSNS.2024.107910MaRDI QIDQ6199710zbMATH OpenFDO

Authors Xavier Molinero, Fabián Riquelme, Maria Serna

Publication date 21 March 2024

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

zbMATH Keywords

computational complexitysocial networkclusterabilitycooperative gamesigned graph

Mathematics Subject Classification ID

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

Recommendations

• Signed network formation games and clustering balance
• Probabilistic path-disruption games
• Signed graphs with negative self evaluation and clusterability of graphs
• Path-disruption games: bribery and a probabilistic model
• scientific article; zbMATH DE number 996908

Cites work

• scientific article; zbMATH DE number 49085 (Why is no real title available?)
• scientific article; zbMATH DE number 49749 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1766750 (Why is no real title available?)
• scientific article; zbMATH DE number 1357433 (Why is no real title available?)
• scientific article; zbMATH DE number 7626779 (Why is no real title available?)
• scientific article; zbMATH DE number 7646025 (Why is no real title available?)
• A simple algorithm to detect balance in signed graphs
• Community detection and stochastic block models
• Computational Aspects of Cooperative Game Theory
• Cooperation through social influence
• Estimating the number of weak balance structures in signed networks
• Forms of representation for simple games: sizes, conversions and equivalences
• Frustration-critical signed graphs
• Games on signed graphs
• On the Complexity of Cooperative Solution Concepts
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• On the complexity of problems on simple games
• Power Indices in Spanning Connectivity Games
• The Complexity of Enumeration and Reliability Problems
• The disjoint paths problem in quadratic time

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

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