Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs

DOI10.1007/978-3-030-93409-5_71zbMath1506.90166OpenAlexW4205961549MaRDI QIDQ2086688

Yao-Wei Tseng, Po-An Chen, Ya-Wen Cheng

Publication date: 25 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93409-5_71

zbMATH Keywords

mixed integer programmingdirected acyclic graphsLP randomized roundingopinion maximization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Mixed integer programming (90C11)

Uses Software

• Gurobi
• SNAP

Cites Work

• Group pinning consensus under fixed and randomly switching topologies with acyclic partition
• Introductory lectures on convex optimization. A basic course.
• Bounds on the price of anarchy for a more general class of directed graphs in opinion formation games
• A two-stage stochastic programming approach for influence maximization in social networks
• How bad is forming your own opinion?
• Social influence and opinions
• Reaching a Consensus

This page was built for publication: Mixed integer programming and LP rounding for opinion maximization on directed acyclic graphs