| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
08 February 2025 |
|
| | | |
|
Article overview
| |
|
Distributed Algorithms for Aggregative Games on Graphs | Jayash Koshal
; Angelia Nedić
; Uday V. Shanbhag
; | Date: |
1 May 2016 | Abstract: | We consider a class of Nash games, termed as aggregative games, being played
over a networked system. In an aggregative game, a player’s objective is a
function of the aggregate of all the players’ decisions. Every player maintains
an estimate of this aggregate, and the players exchange this information with
their local neighbors over a connected network. We study distributed
synchronous and asynchronous algorithms for information exchange and
equilibrium computation over such a network. Under standard conditions, we
establish the almost-sure convergence of the obtained sequences to the
equilibrium point. We also consider extensions of our schemes to aggregative
games where the players’ objectives are coupled through a more general form of
aggregate function. Finally, we present numerical results that demonstrate the
performance of the proposed schemes. | Source: | arXiv, 1605.0267 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|