( en | de | ru )

 

Disambiguation of "Lianeas, Thanasis"

Author of the publication

copydeleteadd this publication to your clipboard
On the Hardness of Network Design for Bottleneck Routing Games.

, , , and . SAGT, volume 7615 of Lecture Notes in Computer Science, page 156-167. Springer, (2012)

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.

No persons found for author name Lianeas, Thanasis
add a person with the name Lianeas, Thanasis
 

Other publications of authors with the same name

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games., , , , , and . CoRR, (2019)Escaping Braess's paradox through approximate Caratheodory's theorem., , , and . Inf. Process. Lett., (2023)Stochastic Congestion Games with Risk-Averse Players., , and . SAGT, volume 8146 of Lecture Notes in Computer Science, page 86-97. Springer, (2013)Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent., , , and . NeurIPS, (2020)Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators., , , , and . Oper. Res., 70 (1): 472-489 (2022)On the hardness of network design for bottleneck routing games., , , and . Theor. Comput. Sci., (2014)Improving Selfish Routing for Risk-Averse Players., , and . Theory Comput. Syst., 64 (2): 339-370 (2020)Resolving Braess's Paradox in Random Networks., , , and . WINE, volume 8289 of Lecture Notes in Computer Science, page 188-201. Springer, (2013)No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix., , , , and . NeurIPS, (2020)Resolving Braess's Paradox in Random Networks., , , and . Algorithmica, 78 (3): 788-818 (2017)