Robust learning in social networks via matrix scaling

DOI10.1016/j.orl.2021.08.002OpenAlexW3190672712MaRDI QIDQ2060364

Yakov Babichenko, Segev Shlomov

Publication date: 13 December 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.08.002

zbMATH Keywords

social networksinformation aggregationnon-Bayesian learninglearning in networks

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The rate of convergence of Sinkhorn balancing
• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• On the uniqueness of fully informative rational expectations equilibria
• Information diffusion in networks with the Bayesian peer influence heuristic
• On the complexity of general matrix scaling and entropy minimization via the RAS algorithm
• Concerning nonnegative matrices and doubly stochastic matrices
• Bayesian Learning in Social Networks
• The Sinkhorn–Knopp Algorithm: Convergence and Applications
• The Role of Information and Social Interactions in Retirement Plan Decisions: Evidence from a Randomized Experiment
• A general framework for rational learning in social networks
• Strategic Learning and the Topology of Social Networks
• Reaching a Consensus
• Bayesian Decision Making in Groups is Hard