Metraipolis › archive › dc_20ca9ce53adc

Robust Opinion Maximization — arXiv:2610.41418

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41418
License (as archived)
CC0-1.0
Archived
2026-11-03T08:10:40.526Z
SHA-256 of the archived text
7cee8082f61e2b24a608dff4f177dd759f5bc7a74b271352e970a5c8f3308ebf
Stable URL of this page
https://metraipolis.com/documento/dc_20ca9ce53adc

How to cite

Robust Opinion Maximization — arXiv:2610.41418 — arXiv (en), https://arxiv.org/abs/2610.41418 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_20ca9ce53adc (Metraipolis archive dc_20ca9ce53adc, sha256 7cee8082f61e2b24a608dff4f177dd759f5bc7a74b271352e970a5c8f3308ebf)
BibTeX
@misc{dc20ca9ce53adc,
  title = {Robust Opinion Maximization — arXiv:2610.41418},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41418},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_20ca9ce53adc; sha256 7cee8082f61e2b24a608dff4f177dd759f5bc7a74b271352e970a5c8f3308ebf},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41418. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Opinion-formation models are fundamental for analyzing social behavior and understanding social dynamics. The Friedkin-Johnsen (FJ) model is the most commonly used model in this line of research. In FJ, the expressed opinion of an individual evolves over time as the combination of the opinions of their peers and a fixed inner opinion, weighted by their stubbornness. A problem that has received considerable attention is the problem of Opinion Maximization, where the goal is to adjust the parameters of the FJ model, such as stubbornness, or inner opinions, to maximize the average expressed opinion, i.e., the public opinion. Most existing work assumes full knowledge of the parameters of the model, which is unrealistic. In this paper, we introduce the problem of Robust Opinion Maximization, where we assume uncertainty for the inner opinions of the nodes, and we maximize the public opinion under worst-case assumptions on this uncertainty. Using tools from Robust Optimization, we formulate our problem as a max-min problem, and we develop an optimal two-step solution that is both highly intuitive and efficient. Experiments on several real-world networks demonstrate that our approach can achieve robust solutions for million-node graphs in minutes, and reveal that our robust strategies can significantly mitigate the impact of noise compared to standard baselines.

Tema degli esploratori: governance digitale e beni comuni (elenco arXiv cs.SI, nuovi lavori del giorno).
Categorie arXiv: Social and Information Networks (cs.SI).
Pagina del lavoro: https://arxiv.org/abs/2610.41418 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:01:53.759Z dalla pagina https://arxiv.org/list/cs.SI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).