Online Minimization of Polarization and Disagreement via Low-Rank Matrix Bandits
This paper addresses the online minimization of polarization and disagreement in the Friedkin-Johnsen opinion dynamics model under incomplete information by proposing a two-stage low-rank matrix bandit algorithm that achieves a cumulative regret of through subspace estimation and linear bandit optimization.