Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty

DOI10.1287/opre.2015.1432zbMath1348.91238arXiv1307.0473OpenAlexW2135748500MaRDI QIDQ2830750

Maxim Raginsky, Angelia Nedić

Publication date: 31 October 2016

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

Full work available at URL: https://arxiv.org/abs/1307.0473

zbMATH Keywords

social networksKnightian uncertaintydecentralized optimizationregret minimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Decision theory (91B06)

Related Items (1)

Preface to the Special Issue on Information and Decisions in Social and Economic Networks

Cites Work

• Unnamed Item
• Non-Bayesian social learning
• Curvature, concentration and error estimates for Markov chain Monte Carlo
• Ricci curvature of Markov chains on metric spaces
• Matrix norms and rapid mixing for spin systems
• Evolution, learning, and economic behavior
• The statistical mechanics of strategic interaction
• Calibrated learning and correlated equilibrium
• Learning, hypothesis testing, and Nash equilibrium.
• Regret in the on-line decision problem
• Knightian decision theory. I.
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Markov chains for exploring posterior distributions. (With discussion)
• The logit-response dynamics
• Efficient algorithms for online decision problems
• Bayesian Learning in Social Networks
• Rational Learning Leads to Nash Equilibrium
• Random walks in a convex body and an improved volume algorithm
• A Simple Adaptive Procedure Leading to Correlated Equilibrium
• On the Optimum Rate of Transmitting Information
• 10.1162/1532443041424328
• Correlation Decay in Random Decision Networks
• Probability Inequalities for Sums of Bounded Random Variables
• Minimax option pricing meets black-scholes in the limit
• Time-Dependent Statistics of the Ising Model
• Games with Incomplete Information Played by “Bayesian” Players, I–III Part I. The Basic Model
• Team Decision Problems
• Combinatorial criteria for uniqueness of Gibbs measures
• A general class of adaptive strategies

This page was built for publication: Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty