A distributed optimization algorithm for Nash bargaining in multi-agent systems

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Autoren

  • Andrea Camisa
  • Philipp N. Kohler
  • Matthias Müller
  • Giuseppe Notarstefano
  • Frank Allgöwer

Organisationseinheiten

Externe Organisationen

  • Universität Stuttgart
  • Università di Bologna
Forschungs-netzwerk anzeigen

Details

OriginalspracheEnglisch
Seiten (von - bis)2684-2689
Seitenumfang6
FachzeitschriftIFAC-PapersOnLine
Jahrgang53
Ausgabenummer2
PublikationsstatusVeröffentlicht - 2020

Abstract

In 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. Since fairness is 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.

ASJC Scopus Sachgebiete

Zitieren

A distributed optimization algorithm for Nash bargaining in multi-agent systems. / Camisa, Andrea; Kohler, Philipp N.; Müller, Matthias et al.
in: IFAC-PapersOnLine, Jahrgang 53, Nr. 2, 2020, S. 2684-2689.

Publikation: Beitrag in FachzeitschriftArtikelForschungPeer-Review

Camisa, A, Kohler, PN, Müller, M, Notarstefano, G & Allgöwer, F 2020, 'A distributed optimization algorithm for Nash bargaining in multi-agent systems', IFAC-PapersOnLine, Jg. 53, Nr. 2, S. 2684-2689. https://doi.org/10.1016/j.ifacol.2020.12.402
Camisa, A., Kohler, P. N., Müller, M., Notarstefano, G., & Allgöwer, F. (2020). A distributed optimization algorithm for Nash bargaining in multi-agent systems. IFAC-PapersOnLine, 53(2), 2684-2689. https://doi.org/10.1016/j.ifacol.2020.12.402
Camisa A, Kohler PN, Müller M, Notarstefano G, Allgöwer F. A distributed optimization algorithm for Nash bargaining in multi-agent systems. IFAC-PapersOnLine. 2020;53(2):2684-2689. doi: 10.1016/j.ifacol.2020.12.402
Camisa, Andrea ; Kohler, Philipp N. ; Müller, Matthias et al. / A distributed optimization algorithm for Nash bargaining in multi-agent systems. in: IFAC-PapersOnLine. 2020 ; Jahrgang 53, Nr. 2. S. 2684-2689.
Download
@article{d603836cfe854f2bac59782b647042a8,
title = "A distributed optimization algorithm for Nash bargaining in multi-agent systems",
abstract = "In 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. Since fairness is 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.",
keywords = "Cooperative game theory, Distributed model predictive control, Distributed optimization, Multi-Objective optimization, Nash bargaining, Network games",
author = "Andrea Camisa and Kohler, {Philipp N.} and Matthias M{\"u}ller and Giuseppe Notarstefano and Frank Allg{\"o}wer",
year = "2020",
doi = "10.1016/j.ifacol.2020.12.402",
language = "English",
volume = "53",
pages = "2684--2689",
number = "2",

}

Download

TY - JOUR

T1 - A distributed optimization algorithm for Nash bargaining in multi-agent systems

AU - Camisa, Andrea

AU - Kohler, Philipp N.

AU - Müller, Matthias

AU - Notarstefano, Giuseppe

AU - Allgöwer, Frank

PY - 2020

Y1 - 2020

N2 - In 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. Since fairness is 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.

AB - In 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. Since fairness is 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.

KW - Cooperative game theory

KW - Distributed model predictive control

KW - Distributed optimization

KW - Multi-Objective optimization

KW - Nash bargaining

KW - Network games

UR - http://www.scopus.com/inward/record.url?scp=85105067609&partnerID=8YFLogxK

U2 - 10.1016/j.ifacol.2020.12.402

DO - 10.1016/j.ifacol.2020.12.402

M3 - Article

VL - 53

SP - 2684

EP - 2689

JO - IFAC-PapersOnLine

JF - IFAC-PapersOnLine

SN - 2405-8963

IS - 2

ER -

Von denselben Autoren