Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix

Salehisadaghiani, Farzad and Pavel, Lacra (2019) Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix. EAI Endorsed Transactions on Collaborative Computing, 4 (13): e1. ISSN 2312-8623

[img]
Preview
Text
eai.13-7-2018.158526.pdf - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (2MB) | Preview

Abstract

We propose a distributed Nash equilibrium seeking algorithm in a networked game, where each player has incomplete information on other players’ actions. Players keep estimates and communicate over a strongly connected digraph with their neighbours according to a gossip communication protocol. Due to the asymmetric information exchange between players, a non-doubly (row)-stochastic weight matrix is defined. We prove almost-sure convergence of the algorithm to a Nash equilibrium under diminishing step-sizes. We extend the algorithm to graphical games in which players’ cost functions are dependent only on their neighbouring players in an interference digraph. Given the interference digraph, a communication digraph is designed so that players exchange only their required information. The communication digraph is a subset of the interference digraph and a superset of its transitive reduction. Finally, we verify the efficacy of the algorithm via simulation on a social media behavioural case.

Item Type: Article
Uncontrolled Keywords: Nash equilibrium, communication graph, information exchange
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
QA75 Electronic computers. Computer science
Depositing User: EAI Editor II.
Date Deposited: 11 Sep 2020 09:13
Last Modified: 11 Sep 2020 09:13
URI: https://eprints.eudl.eu/id/eprint/239

Actions (login required)

View Item View Item