( en | de | ru )

 

Disambiguation of "Lianeas, Thanasis"

Author of the publication

copydeleteadd this publication to your clipboard
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix.

, , , , and . NeurIPS, (2020)

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

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent., , , and . NeurIPS, (2020)Stochastic Congestion Games with Risk-Averse Players., , and . SAGT, volume 8146 of Lecture Notes in Computer Science, page 86-97. Springer, (2013)Escaping Braess's paradox through approximate Caratheodory's theorem., , , and . Inf. Process. Lett., (2023)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)A Submodular Approach for Electricity Distribution Network Reconfiguration., , , , , , and . HICSS, page 1-10. ScholarSpace / AIS Electronic Library (AISeL), (2018)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)Improving Selfish Routing for Risk-Averse Players., , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 328-342. Springer, (2015)Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games., , , , , and . ICALP, volume 168 of LIPIcs, page 50:1-50:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Risk-Averse Selfish Routing., , and . Math. Oper. Res., 44 (1): 38-57 (2019)