( en | de | ru )

 

Disambiguation of "Harks, Tobias"

Author of the publication

copydeleteadd this publication to your clipboard
Congestion games viewed from M-convexity.

, , , , and . Oper. Res. Lett., 43 (3): 329-333 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Tobias Harks

Tobias Harks

Hans Harks

Walter Harks

Monika Harks

 

Other publications of authors with the same name

Dynamic Flows with Adaptive Route Choice., and . CoRR, (2018)Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games., and . ISCO, volume 9849 of Lecture Notes in Computer Science, page 98-109. Springer, (2016)The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks., , and . INFOCOM, page 2043-2051. IEEE, (2010)Optimal cost sharing for capacitated facility location games., and . CTW, volume WP 13-01 of CTIT Workshop Proceedings, page 99-102. (2013)Bottleneck Routing with Elastic Demands., , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 384-397. Springer, (2015)Congestion control in utility fair networks., and . Comput. Networks, 52 (15): 2947-2960 (2008)Priority Pricing in Utility Fair Networks., and . ICNP, page 311-320. IEEE Computer Society, (2005)Dynamic Traffic Assignment for Electric Vehicles., , and . ATMOS, volume 106 of OASIcs, page 6:1-6:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Matroids Are Immune to Braess' Paradox., , , , and . Math. Oper. Res., 42 (3): 745-761 (2017)Optimal cost sharing protocols for scheduling games., and . EC, page 285-294. ACM, (2011)