Consensus Planning with Primal, Dual, and Proximal Agents
Alvaro Maggiar, Lee Dicker, Michael Mahoney

TL;DR
This paper introduces a versatile consensus planning algorithm that coordinates heterogeneous agents with primal, dual, and proximal interfaces, ensuring convergence and practical applicability in complex, real-world systems.
Contribution
It extends consensus algorithms to handle mixed agent types, combining ADMM-like, dual ascent, and linearized ADMM updates, with proven convergence guarantees.
Findings
The algorithm converges with a sublinear O(1/k) rate under mild conditions.
It achieves two-step linear convergence under stronger assumptions.
Empirical results demonstrate practical effectiveness.
Abstract
Consensus planning is a method for coordinating decision making across complex systems and organizations, including complex supply chain optimization pipelines. It arises when large interdependent distributed agents (systems) share common resources and must act in order to achieve a joint goal. In prior consensus planning work, all agents have been assumed to have the same interaction pattern (e.g., all dual agents or all primal agents or all proximal agents), most commonly using the Alternating Direction Method of Multipliers (ADMM) as proximal agents. However, this is often not a valid assumption in practice, where agents consist of large complex systems, and where we might not have the luxury of modifying these large complex systems at will. In this paper, we introduce a consensus algorithm that overcomes this hurdle by allowing for the coordination of agents with different types of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Logic, programming, and type systems · AI-based Problem Solving and Planning
