摘要：AbstractIn this paper, we consider a multi-objective optimization problem over networks in which agents aim to maximize their own objective function, while satisfying both local and coupling constraints. This set up includes, e.g., the computation of optimal steady states in multi-agent control systems. Sincefairnessis a key feature required for the solution, we resort to Cooperative Game Theory and search for the Nash bargaining solution among all the efficient (or Pareto optimal) points of a bargaining game. We propose a negotiation mechanism among the agents to compute such a solution in a distributed way. The problem is reformulated as the maximization of a properly weighted sum of the objective functions. The proposed algorithm is then a two step procedure in which local estimates of the Nash bargaining weights are updated online and existing distributed optimization algorithms are applied. The proposed method is formally analyzed for a particular case, while numerical simulations are provided to corroborate the theoretical findings and to demonstrate its efficacy
关键词：KeywordsCooperative game theoryDistributed optimizationMulti-Objective optimizationNash bargainingDistributed model predictive controlNetwork games
