Correlation Decay in Random Decision Networks

DOI10.1287/moor.2013.0609zbMath1291.90047arXiv0912.0338OpenAlexW2963083065MaRDI QIDQ5169700

David A. Goldberg, Theophane Weber, David Gamarnik

Publication date: 11 July 2014

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

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

zbMATH Keywords

optimizationNP-hardnesslong-range independence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Stochastic network models in operations research (90B15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (4)

Scalable Reinforcement Learning for Multiagent Networked Systems ⋮ Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times ⋮ Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems ⋮ Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty

This page was built for publication: Correlation Decay in Random Decision Networks