zweidimensionales bewegtes Bild
Existence and Complexity of Approximate Equilibria in Weighted Congestion Games: Q/A Session D - Paper D1.B
- Standort
-
Hannover TIB
- Umfang
-
63MB, 00:23:41:27 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
47th International Colloquium on Automata, Languages and Programming (ICALP) 2020 ; (Jan. 2020)
- Ereignis
-
Veröffentlichung
- (wer)
-
Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
- (wann)
-
2020-01-01
- Beteiligte Personen und Organisationen
-
Poças, Diogo
Christodoulou, George
Gairing, Martin
Giannakopoulos, Yiannis
Waldmann, Clara
- DOI
-
10.5446/49395
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Poças, Diogo
- Christodoulou, George
- Gairing, Martin
- Giannakopoulos, Yiannis
- Waldmann, Clara
- Center for Perspicuous Computing – TRR 248, Saarland Informatics Campus (SIC)
Entstanden
- 2020-01-01
Ähnliche Objekte (12)
Approximate pure nash equilibria in congestion, opinion formation and facility location games
Approximate Versus Exact Equilibria
Weighted congestion games with separable preferences
Congestion Games: Equilibria, Networks, and Complexity
Approximate Competitive Equilibria in Large Economies
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games: Q/A Session D - Paper D1.D
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Network topology and equilibrium existence in weighted network congestion games
![Qa- [Qa-]](https://iiif.deutsche-digitale-bibliothek.de/image/2/ad9b8567-c447-46da-a7ba-53b4975e74ba/full/!306,450/0/default.jpg)
Qa- [Qa-]
Learning to Play Approximate Nash Equilibria in Games with Many Players
Approximate pure nash equilibria in congestion, opinion formation and facility location games
Approximate Versus Exact Equilibria
Weighted congestion games with separable preferences
Congestion Games: Equilibria, Networks, and Complexity
Approximate Competitive Equilibria in Large Economies
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games: Q/A Session D - Paper D1.D
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Network topology and equilibrium existence in weighted network congestion games
Qa- [Qa-]
Learning to Play Approximate Nash Equilibria in Games with Many Players
Approximate pure nash equilibria in congestion, opinion formation and facility location games
Approximate Versus Exact Equilibria
Weighted congestion games with separable preferences
Congestion Games: Equilibria, Networks, and Complexity
Approximate Competitive Equilibria in Large Economies
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games: Q/A Session D - Paper D1.D
Nash equilibria and improvement dynamics in congestion games
Nash equilibria and improvement dynamics in congestion games
Uniqueness of equilibria in atomic splittable polymatroid congestion games
Network topology and equilibrium existence in weighted network congestion games
Qa- [Qa-]