Is this is a real field separate from all the things that looks similar to it? e.g.probability collectives (are they a thing?) and the nature-inspired algorithms people get disturbingly enthusiastic about (ant colonies, particle swarms, that one based on choirs…), and reliability engineering (Byzantine generals etc), …and quorum sensing? How about that?
Local versus global design
I’m particular interested in the constraints on what global organising can be done using local information. There are formal approaches to this, e.g. H. Wang and Rubenstein (2020) and more fun and even cheap ones like Mordvintsev et al. (2020).
Incentive design
If your network has autonomous agents that need to cooperate, how do you design their private utility? Although this looks a little bit like collective decisions, I am thinking of more incentive design-oriented questions. When we say “multi agent systems” there is usually a presumption that the individual agents are fairly simple, not whole human beings. Special case: flocking. The barriers betwixt these are permeable.
Graph topology
If the graph topology of connections is not 1:N but something more complicated, what happens to learnability? What if you need to discover something controlling for graph topology? I have arbitrarily filed that under inference on social graphs.
Misc links
Yoav Shoham and Kevin Leyton-Brown’s textbook, Multiagent Systems Algorithmic, Game-Theoretic, and Logical Foundations is downloadable
Distributed information processing in biological and computational systems
Yujian, Digest: Consensus Filters is a quick intro to signal analysis using consensus filters
As metaphor for human systems
See wisdom of crowds versus groupthink, or possible weaponized social media.
References
Acemoglu, Daron, and Asuman Ozdaglar. 2011. “Opinion Dynamics and Learning in Social Networks.” Dynamic Games and Applications 1 (1): 3–49.
Achlioptas, Dimitris, Aaron Clauset, David Kempe, and Cristopher Moore. 2005. “On the Bias of Traceroute Sampling: Or, Power-Law Degree Distributions in Regular Graphs.” In Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, 694–703. STOC ’05. New York, NY, USA: ACM.
Akbarpour, Mohammad, and Matthew O. Jackson. 2018. “Diffusion in Networks and the Virtue of Burstiness.” Proceedings of the National Academy of Sciences 115 (30): E6996–7004.
Akyildiz, Ian F., Weilian Su, Yogesh Sankarasubramaniam, and Erdal Cayirci. 2002. “A Survey on Sensor Networks.” Communications Magazine, IEEE 40 (8): 102–14.
Bianchi, P., and J. Jakubowicz. 2013. “Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization.” IEEE Transactions on Automatic Control 58 (2): 391–405.
Bieniawski, Stefan, and David H. Wolpert. 2004. “Adaptive, Distributed Control of Constrained Multi-Agent Systems.” In Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems-Volume 3, 4:1230–31. IEEE Computer Society.
Bishop, Adrian N., and Arnaud Doucet. 2014. “Distributed Nonlinear Consensus in the Space of Probability Measures.” IFAC Proceedings Volumes, 19th IFAC World Congress, 47 (3): 8662–68.
Cattivelli, Federico S., Cassio G. Lopes, and Ali H. Sayed. 2008. “Diffusion Recursive Least-Squares for Distributed Estimation over Adaptive Networks.” IEEE Transactions on Signal Processing 56 (5): 1865–77.
Cattivelli, Federico S., and Ali H. Sayed. 2009. “Diffusion LMS Strategies for Distributed Estimation.” IEEE Transactions on Signal Processing 58 (3): 1035–48.
———. 2010. “Diffusion Strategies for Distributed Kalman Filtering and Smoothing.” IEEE Transactions on Automatic Control 55 (9): 2069–84.
Chen, Jianshu, and Ali H. Sayed. 2012. “Diffusion Adaptation Strategies for Distributed Optimization and Learning over Networks.” IEEE Transactions on Signal Processing 60 (8): 4289–4305.
Codenotti, Bruno, and Kasturi Varadarajan. 2004. “Efficient Computation of Equilibrium Prices for Markets with Leontief Utilities.” In ICALP, 371–82. Springer.
Degroot, Morris H. 1974. “Reaching a Consensus.” Journal of the American Statistical Association 69 (345): 118–21.
Deng, Xiaotie, Christos Papadimitriou, and Shmuel Safra. 2002. “On the Complexity of Equilibria.” In Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, 67–71. STOC ’02. New York, NY, USA: ACM.
Di Lorenzo, Paolo, and Ali H. Sayed. 2013. “Sparse Distributed Learning Based on Diffusion Adaptation.” IEEE Transactions on Signal Processing 61 (6): 1419–33.
Freeman, R.A., Peng Yang, and K.M. Lynch. 2006. “Stability and Convergence Properties of Dynamic Average Consensus Estimators.” In 2006 45th IEEE Conference on Decision and Control, 338–43. San Diego, CA, USA: IEEE.
Galesic, Mirta, Daniel Barkoczi, and Konstantinos Katsikopoulos. 2018. “Smaller Crowds Outperform Larger Crowds and Individuals in Realistic Task Conditions.” Decision 5 (1): 1–15.
Hong, Lu, and Scott E. Page. 2004. “Groups of Diverse Problem Solvers Can Outperform Groups of High-Ability Problem Solvers.” Proceedings of the National Academy of Sciences 101 (46): 16385–89.
Kayaalp, Mert, Virginia Bordignon, Stefan Vlaski, and Ali H. Sayed. 2021. “Hidden Markov Modeling over Graphs.” arXiv:2111.13626 [Cs, Eess], November.
Lalitha, Anusha, Tara Javidi, and Anand Sarwate. 2014. “Social Learning and Distributed Hypothesis Testing.” arXiv:1410.4307 [Cs, Math, Stat], October.
Lopes, Cassio G., and Ali H. Sayed. 2007. “Incremental Adaptive Strategies over Distributed Networks.” IEEE Transactions on Signal Processing 55 (8): 4064–77.
———. 2008. “Diffusion Least-Mean Squares over Adaptive Networks: Formulation and Performance Analysis.” IEEE Transactions on Signal Processing 56 (7): 3122–36.
Mann, Richard P., and Dirk Helbing. 2016. “Minorities Report: Optimal Incentives for Collective Intelligence.” arXiv:1611.03899 [Cs, Math, Stat], November.
Mateo, David, Nikolaj Horsevad, Vahid Hassani, Mohammadreza Chamanbaz, and Roland Bouffanais. 2019. “Optimal Network Topology for Responsive Collective Behavior.” Science Advances 5 (4).
Mordvintsev, Alexander, Ettore Randazzo, Eyvind Niklasson, and Michael Levin. 2020. “Growing Neural Cellular Automata.” Distill 5 (2): e23.
Ohsawa, Shohei. 2021. “Unbiased Self-Play.” arXiv:2106.03007 [Cs, Econ, Stat], June.
Olfati-Saber, R. 2006. “Flocking for Multi-Agent Dynamic Systems: Algorithms and Theory.” Automatic Control, IEEE Transactions on 51 (3): 401–20.
Olfati-Saber, R. 2005. “Distributed Kalman Filter with Embedded Consensus Filters.” In 44th IEEE Conference on Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC ’05, 8179–84. Seville, Spain: IEEE.
Olfati-Saber, R., J.A. Fax, and R.M. Murray. 2007. “Consensus and Cooperation in Networked Multi-Agent Systems.” Proceedings of the IEEE 95 (1): 215–33.
Ren, W, and R W Beard. 2005. “Consensus Seeking in Multiagent Systems Under Dynamically Changing Interaction Topologies.” Automatic Control, IEEE Transactions on 50 (5): 655–61.
Samuelson, Larry. 2001. “Analogies, Adaptation, and Anomalies.” Journal of Economic Theory 97 (2): 320–66.
Sayed, Ali. 2014. “Adaptation, Learning, and Optimization over Networks.” Foundations and Trends® in Machine Learning 7 (4-5): 311–801.
Sayed, Ali H. 2014. “Adaptive Networks.” Proceedings of the IEEE 102 (4): 460–97.
Spanos, Demetri P., Reza Olfati-Saber, and Richard M. Murray. 2005. “Dynamic Consensus on Mobile Networks.” In IFAC World Congress, 1–6. Citeseer.
Stiglitz, Joseph E. 2006. “The Contributions of the Economics of Information to Twentieth Century Economics.” The Quarterly Journal of Economics 115 (4).
Tumer, Kagan, and David H Wolpert. 2004. “Coordination in Large Collectives- Chapter 1.” In.
Wang, Hanlin, and Michael Rubenstein. 2020. “Shape Formation in Homogeneous Swarms Using Local Task Swapping.” IEEE Transactions on Robotics, 1–16.
Wang, Shengdi, and Armin Dekorsy. 2020. “A Factor Graph-Based Distributed Consensus Kalman Filter.” IEEE Signal Processing Letters 27: 2039–43.
Wolpert, David H. 2006. “Advances in Distributed Optimization Using Probability Collectives.” Advances in Complex Systems 9.
Wolpert, David H. 2004. “Information Theory - The Bridge Connecting Bounded Rational Game Theory and Statistical Physics,” February.
Wolpert, David H, Stefan R Bieniawski, and Dev G Rajnarayan. 2011. “Probability Collectives in Optimization.”
Wolpert, David H, and John W Lawson. 2002. “Designing Agent Collectives for Systems with Markovian Dynamics.” In, 1066–73.
Wolpert, David H., and Kagan Tumer. 1999. “An Introduction to Collective Intelligence.” arXiv:cs/9908014, August.
Wolpert, David H, Kevin R Wheeler, and Kagan Tumer. 1999. “General Principles of Learning-Based Multi-Agent Systems.” In, 77–83.
———. 2000. “Collective Intelligence for Control of Distributed Dynamical Systems.” EPL (Europhysics Letters) 49: 708.
Ye, Yinyu. 2008. “A Path to the Arrow–Debreu Competitive Market Equilibrium.” Mathematical Programming 111 (1-2): 315–48.
Zhang, Rui, and Quanyan Zhu. 2017. “Game-Theoretic Design of Secure and Resilient Distributed Support Vector Machines with Adversaries.” arXiv:1710.04677 [Cs, Stat], October.
Zhao, Xiaochuan, and Ali H. Sayed. 2014. “Asynchronous Adaptation and Learning over Networks — Part I: Modeling and Stability Analysis.” arXiv:1312.5434 [Cs, Math], December.
Zivojevic, Dino, Muhamed Delalic, Darijo Raca, Dejan Vukobratovic, and Mirsad Cosovic. 2021. “Distributed Weighted Least-Squares and Gaussian Belief Propagation: An Integrated Approach.” Preprint.
No comments yet. Why not leave one?