A gossip algorithm for aggregative games on graphs

Jayash Koshal, Angelia Nedic, Vinayak V. Shanbhag

Research output: Contribution to journalConference article

30 Citations (Scopus)

Abstract

We consider a class of games, termed as aggregative games, being played over a distributed multi-agent networked system. In an aggregative game, an agent's objective function is coupled through a function of the aggregate of all agents decisions. Every agent maintains an estimate of the aggregate and agents exchange this information over a connected network. We study the gossip-based distributed algorithm for the exchange of information and computation of equilibrium decisions of agents over the network. Our primary emphasis lies in proving the convergence of the algorithm under an assumption of a diminishing (agent-specific) step-size sequence. Under standard conditions, we establish the almost-sure convergence of the generated sequence to the unique equilibrium point.

Original languageEnglish (US)
Article number6426136
Pages (from-to)4840-4845
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
StatePublished - Dec 1 2012
Event51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States
Duration: Dec 10 2012Dec 13 2012

Fingerprint

Gossip
Game
Graph in graph theory
Almost Sure Convergence
Diminishing
Distributed Algorithms
Equilibrium Point
Parallel algorithms
Objective function
Estimate

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

@article{45d477641ec840d48a636d9f35fc3713,
title = "A gossip algorithm for aggregative games on graphs",
abstract = "We consider a class of games, termed as aggregative games, being played over a distributed multi-agent networked system. In an aggregative game, an agent's objective function is coupled through a function of the aggregate of all agents decisions. Every agent maintains an estimate of the aggregate and agents exchange this information over a connected network. We study the gossip-based distributed algorithm for the exchange of information and computation of equilibrium decisions of agents over the network. Our primary emphasis lies in proving the convergence of the algorithm under an assumption of a diminishing (agent-specific) step-size sequence. Under standard conditions, we establish the almost-sure convergence of the generated sequence to the unique equilibrium point.",
author = "Jayash Koshal and Angelia Nedic and Shanbhag, {Vinayak V.}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/CDC.2012.6426136",
language = "English (US)",
pages = "4840--4845",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

A gossip algorithm for aggregative games on graphs. / Koshal, Jayash; Nedic, Angelia; Shanbhag, Vinayak V.

In: Proceedings of the IEEE Conference on Decision and Control, 01.12.2012, p. 4840-4845.

Research output: Contribution to journalConference article

TY - JOUR

T1 - A gossip algorithm for aggregative games on graphs

AU - Koshal, Jayash

AU - Nedic, Angelia

AU - Shanbhag, Vinayak V.

PY - 2012/12/1

Y1 - 2012/12/1

N2 - We consider a class of games, termed as aggregative games, being played over a distributed multi-agent networked system. In an aggregative game, an agent's objective function is coupled through a function of the aggregate of all agents decisions. Every agent maintains an estimate of the aggregate and agents exchange this information over a connected network. We study the gossip-based distributed algorithm for the exchange of information and computation of equilibrium decisions of agents over the network. Our primary emphasis lies in proving the convergence of the algorithm under an assumption of a diminishing (agent-specific) step-size sequence. Under standard conditions, we establish the almost-sure convergence of the generated sequence to the unique equilibrium point.

AB - We consider a class of games, termed as aggregative games, being played over a distributed multi-agent networked system. In an aggregative game, an agent's objective function is coupled through a function of the aggregate of all agents decisions. Every agent maintains an estimate of the aggregate and agents exchange this information over a connected network. We study the gossip-based distributed algorithm for the exchange of information and computation of equilibrium decisions of agents over the network. Our primary emphasis lies in proving the convergence of the algorithm under an assumption of a diminishing (agent-specific) step-size sequence. Under standard conditions, we establish the almost-sure convergence of the generated sequence to the unique equilibrium point.

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

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

U2 - 10.1109/CDC.2012.6426136

DO - 10.1109/CDC.2012.6426136

M3 - Conference article

SP - 4840

EP - 4845

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

M1 - 6426136

ER -