Online conflict resolution: algorithm design and analysis

DOI10.1016/J.INS.2023.119718MaRDI QIDQ6084129zbMATH OpenOpenAlexFDO

Authors Guoyao Rao, Deying Li, Yongcai Wang, Wenping Chen, Chunlai Zhou, Yuqing Zhu

Publication date 31 October 2023

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2023.119718

zbMATH Keywords

influence maximizationonline conflictssocial networks

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Social networks; opinion dynamics (91D30)

Review text

This paper studies algorithm design and analysis of online conflict resolution. A probability \(p_a(u)\) is taken to measure the likelihood of an attacker \(u\) begin persuaded to stop the conflicts by its close friends. This probability follows the Bernoulli process in which u is persuaded by each close friend one by one with the same probability. The paper formulates the online conflicts to a discrete optimization of choosing seeds to spread mediation influence over social networks to minimize the attack to all sufferers. The problem is NP-hard and the objective is \(\#\)P-hard to compute. An estimation method is proposed for the objective function employing the reverse sampling technique. Some experiments are conducted using real-world datasets.

Recommendations

• Modeling conflict processes on the Internet
• Community-based acceptance probability maximization for target users on social networks
• Discount allocation for cost minimization in online social networks
• General rumor blocking: an efficient random algorithm with martingale approach
• scientific article; zbMATH DE number 6474901

Cites work

• An analysis of approximations for maximizing submodular set functions—I
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Matching influence maximization in social networks
• Maximizing social influence in nearly optimal time
• Union acceptable profit maximization in social networks

Cited in

(3)

• scientific article; zbMATH DE number 5957338 (Why is no real title available?)
• Target influence maximization problem under avoiding unexpected users interruption in online social network
• Generative flow networks for influence maximization in social networks

This page was built for publication: Online conflict resolution: algorithm design and analysis

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