( en | de | ru )

 

Disambiguation of "Harks, Tobias"

Author of the publication

copydeleteadd this publication to your clipboard
Routing Games With Progressive Filling.

, , , and . IEEE/ACM Trans. Netw., 24 (4): 2553-2562 (2016)

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

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)Quantitative Comparative Statics for a Multimarket Paradox., and . WINE, volume 8289 of Lecture Notes in Computer Science, page 230-231. Springer, (2013)Machine-Learned Prediction Equilibrium for Dynamic Traffic Assignment., , , and . AAAI, page 5059-5067. AAAI Press, (2022)Multi-Leader Congestion Games with an Adversary., , , , and . AAAI, page 5068-5075. AAAI Press, (2022)Correction to: Broadcasting a file in a communication network., , and . J. Sched., 25 (2): 257 (2022)Competitive Packet Routing with Priority Lists., , , , and . ACM Trans. Economics and Comput., 6 (1): 4:1-4:26 (2018)Computing User Equilibria for Schedule-Based Transit Networks with Hard Vehicle Capacities., , , and . CoRR, (2024)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)