Distributed Optimization
Lists
Only you see this
Abstract
We demonstrate a new framework for analyzing and controlling distributed systems, by solving constrained optimization problems with an algorithm based on that framework. The framework is ar. information-theoretic extension of conventional full-rationality game theory to allow bounded rational agents. The associated optimization algorithm is a game in which agents control the variables of the optimization problem. They do this by jointly minimizing a Lagrangian of (the probability distribution of) their joint state. The updating of the Lagrange parameters in that Lagrangian is a form of automated annealing, one that focuses the multi-agent system on the optimal pure strategy. We present computer experiments for the k-sat constraint satisfaction problem and for unconstrained minimization of NK functions.
BibTeX
@inproceedings{shoham2008distributed,
author = {Yoav Shoham and Kevin Leyton‐Brown},
title = {{Distributed Optimization}},
booktitle = {Cambridge},
year = {2008},
doi = {10.1017/cbo9780511811654.003},
}Loading related content...