{
  "id": "1803.10618",
  "version": "v2",
  "published": "2018-03-28T13:58:24.000Z",
  "updated": "2018-09-30T16:06:51.000Z",
  "title": "A Douglas-Rachford splitting for semi-decentralized equilibrium seeking in generalized aggregative games",
  "authors": [
    "Giuseppe Belgioioso",
    "Sergio Grammatico"
  ],
  "comment": "arXiv admin note: text overlap with arXiv:1803.10441",
  "categories": [
    "math.OC",
    "cs.GT",
    "cs.SY"
  ],
  "abstract": "We address the generalized aggregative equilibrium seeking problem for noncooperative agents playing average aggregative games with affine coupling constraints. First, we use operator theory to characterize the generalized aggregative equilibria of the game as the zeros of a monotone set-valued operator. Then, we massage the Douglas-Rachford splitting to solve the monotone inclusion problem and derive a single layer, semi-decentralized algorithm whose global convergence is guaranteed under mild assumptions. The potential of the proposed Douglas-Rachford algorithm is shown on a simplified resource allocation game, where we observe faster convergence with respect to forward-backward algorithms.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2018-09-30T16:06:51.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "generalized aggregative games",
      "semi-decentralized equilibrium seeking",
      "douglas-rachford splitting",
      "playing average aggregative games",
      "aggregative equilibrium seeking problem"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}