An algorithm for finding Nash equilibria in dynamic network games
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2094482
- Approximative Nash-equilibria in network games
- A game theoretic approach to the analysis of dynamic networks
- A game-theoretic approach to network equilibrium
- scientific article; zbMATH DE number 6984310
- Distributed Nash equilibrium seeking in networked graphical games
- Equilibrium computation in discrete network games
- Algorithms for finding optimal paths in network games with p players
- A note on generalized Nash games played on networks
- A decomposition algorithm for finding equilibria in dynamic games
Cited in
(11)- Network games; adaptations to Nash-Cournot equilibrium
- A Nash equilibrium based algorithm for mining hidden links in social networks
- scientific article; zbMATH DE number 6984310 (Why is no real title available?)
- Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game
- scientific article; zbMATH DE number 4116343 (Why is no real title available?)
- Equilibrium computation in discrete network games
- scientific article; zbMATH DE number 7500541 (Why is no real title available?)
- Construction of Dynamically Stable Solutions in Differential Network Games
- A finite convergence algorithm for solving linear-quadratic network games with strategic complements and bounded strategies
- Equilibria in a dynamic model of coordination of two firms with nonfixed prices
- A new approach to Gal's theory of search games on weakly Eulerian networks
This page was built for publication: An algorithm for finding Nash equilibria in dynamic network games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2854200)
