.png){kind=icon}
.png){kind=icon}
Return
Ensuring Truthfulness in Distributed Aggregative Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2025.3606265.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Distributed aggregative optimization methods are gaining increased traction due to their ability to address cooperative control and optimization problems, where the objective function of each agent depends not only on its own decision variable but also on the aggregation of other agents’ decision variables. Nevertheless, existing distributed aggregative optimization methods implicitly assume all agents to be truthful in information sharing, which can be unrealistic in real-world scenarios, where agents may act selfishly or strategically. In fact, an opportunistic agent may deceptively share false information in its own favor to minimize its own loss, which, however, will compromise the network-level global performance. To solve this issue, we propose a new distributed aggregative optimization algorithm that can ensure truthfulness of agents and convergence performance. To the best of the authors’ knowledge, this is the first algorithm that ensures truthfulness in a fully distributed setting, where no “centralized” aggregator exists to collect private information/decision variables from participating agents. We systematically characterize the convergence rate of our algorithm under nonconvex/convex/strongly convex objective functions, which generalizes existing distributed aggregative optimization results that only focus on convex objective functions. We also rigorously quantify the tradeoff between convergence performance and the level of enabled truthfulness under different convexity conditions. Numerical simulations using distributed charging of electric vehicles confirm the effectiveness of our algorithm.
Keywords:
Distributed aggregative optimization
joint differential privacy (JDP)
truthfulness
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W