A logarithmic approximation for polymatroid congestion games
Year of publication: |
November 2016
|
---|---|
Authors: | Harks, Tobias ; Oosterwijk, Tim ; Vredeveld, Tjark |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 44.2016, 6, p. 712-717
|
Subject: | Congestion game | Approximation algorithm | Polymatroid | Matroid | Engpass | Bottleneck | Algorithmus | Algorithm | Spieltheorie | Game theory | Nichtkooperatives Spiel | Noncooperative game | Mathematische Optimierung | Mathematical programming | Nash-Gleichgewicht | Nash equilibrium | Verkehrsstau | Traffic congestion |
-
Approximate Nash equilibria in large nonconvex aggregative games
Liu, Kang, (2023)
-
Equilibria in multiclass and multidimensional atomic congestion games
Klimm, Max, (2022)
-
In congestion games, taxes achieve optimal approximation
Paccagnan, Dario, (2024)
- More ...
-
Posted price mechanisms and optimal threshold strategies for random arrivals
Correa, José, (2021)
-
Bicriteria Nash flows over time
Oosterwijk, Tim, (2024)
-
Cyclic lot-sizing problems with sequencing costs
Grigoriev, Alexander, (2021)
- More ...