Approximate pure nash equilibria in congestion, opinion formation and facility location games
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Paderborn, Universität Paderborn, Dissertation, 2018
- Schlagwort
-
Games
- Ereignis
-
Veröffentlichung
- (wo)
-
Paderborn
- (wer)
-
Universitätsbibliothek
- (wann)
-
2019
- Urheber
-
Feldotto, Matthias
- URN
-
urn:nbn:de:hbz:466:2-33455
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:48 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Feldotto, Matthias
- Universitätsbibliothek
Entstanden
- 2019
Ähnliche Objekte (12)
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Learning to Play Approximate Nash Equilibria in Games with Many Players
Approximate Versus Exact Equilibria
How to find Nash equilibria with extreme total latency in network congestion games?
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
Congestion Games: Equilibria, Networks, and Complexity
From Nash to Dependency Equilibria
Nash equilibria of informational extensions
Viable Nash Equilibria: An Experiment
Approximate Competitive Equilibria in Large Economies
Nash equilibria in discrete routing games
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Learning to Play Approximate Nash Equilibria in Games with Many Players
Approximate Versus Exact Equilibria
How to find Nash equilibria with extreme total latency in network congestion games?
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
Congestion Games: Equilibria, Networks, and Complexity
From Nash to Dependency Equilibria
Nash equilibria of informational extensions
Viable Nash Equilibria: An Experiment
Approximate Competitive Equilibria in Large Economies
Nash equilibria in discrete routing games
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Learning to Play Approximate Nash Equilibria in Games with Many Players
Approximate Versus Exact Equilibria
How to find Nash equilibria with extreme total latency in network congestion games?
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
Congestion Games: Equilibria, Networks, and Complexity
From Nash to Dependency Equilibria
Nash equilibria of informational extensions
Viable Nash Equilibria: An Experiment
Approximate Competitive Equilibria in Large Economies