Approximative Nash-equilibria in network games

MaRDI QIDQ3584082zbMATH OpenFDO

Authors Stefan Eilts

Publication date 18 August 2010

Full work available at URL http://www.freidok.uni-freiburg.de/volltexte/6943/pdf/diss3.pdf

zbMATH Keywords

Nash equilibriumnetwork gamesSteiner-Wald game

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Combinatorial games (91A46)

Recommendations

• On approximate Nash equilibria in network design
• Non-cooperative tree creation
• A note on approximate Nash equilibria

Cited in

(6)

• A note on generalized Nash games played on networks
• A variational formulation of network games with random utility functions
• On approximate Nash equilibria in network design
• An algorithm for finding Nash equilibria in dynamic network games
• 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

This page was built for publication: Approximative Nash-equilibria in network games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3584082)