An algorithm for finding Nash equilibria in dynamic network games
type: Item
instance of: scholarly article
zbMATH Open document ID: 1273.91083
author: Andreĭ P. Parfenov
publication date: 2013-10-17T00:00:00Z
full work available at URL: mgta103
Mathematics Subject Classification ID: 91A43
Mathematics Subject Classification ID: 91A25
Mathematics Subject Classification ID: 91A24
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 6216228
zbMATH Keywords: network games
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: optimization algorithms
zbMATH Keywords: algorithm complexity
MaRDI profile type: Publication
Recommended article: Q4812874
Recommended article: Q3584082
Recommended article: A game theoretic approach to the analysis of dynamic networks
Recommended article: A game-theoretic approach to network equilibrium
Recommended article: Q4556159
Recommended article: Distributed Nash equilibrium seeking in networked graphical games
Recommended article: Equilibrium computation in discrete network games
Recommended article: Algorithms for finding optimal paths in network games with \(p\) players
Recommended article: A note on generalized Nash games played on networks
Recommended article: A decomposition algorithm for finding equilibria in dynamic games
title: An algorithm for finding Nash equilibria in dynamic network games
published in: Matematicheskaya Teoriya Igr i eë Prilozheniya
description: scientific article; zbMATH DE number 6216228