Thanasis Lianeas

Publication Activity (10 Years)

Years Active: 2012-2023
Publications (10 Years): 23

Top Topics

Congestion Games

Packet Forwarding

Top Venues

Publications

Sotirios Dimos, Dimitris Fotakis, Thanasis Lianeas, Kyriakos Sergis
Escaping Braess's paradox through approximate Caratheodory's theorem. Inf. Process. Lett. 179 (2023)
José R. Correa, Cristóbal Guzmán, Thanasis Lianeas, Evdokia Nikolova, Marc Schröder
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. Oper. Res. 70 (1) (2022)
Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. NeurIPS (2020)
Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas
Improving Selfish Routing for Risk-Averse Players. Theory Comput. Syst. 64 (2) (2020)
Emmanouil-Vasileios Vlatakis-Gkaragkounis, Lampros Flokas, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix. NeurIPS (2020)
Lampros Flokas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras
No-regret learning and mixed Nash equilibria: They do not mix. CoRR (2020)
Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. CoRR (2020)
Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. ICALP (2020)
Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses
Risk-Averse Selfish Routing. Math. Oper. Res. 44 (1) (2019)
Dimitris Fotakis, Anthimos Vardis Kandiros, Thanasis Lianeas, Nikos Mouzakis, Panagiotis Patsilinakos, Stratis Skoulakis
Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games. CoRR (2019)
Richard Cole, Thanasis Lianeas, Evdokia Nikolova
When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? IJCAI (2018)
Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael Caramanis, Thanasis Lianeas, Emmanouil Pountourakis
A Submodular Approach for Electricity Distribution Network Reconfiguration. HICSS (2018)
José R. Correa, Cristóbal Guzmán, Thanasis Lianeas, Evdokia Nikolova, Marc Schröder
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. EC (2018)
Richard Cole, Thanasis Lianeas, Evdokia Nikolova
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? CoRR (2017)
Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen
Reconciling Selfish Routing with Social Good. CoRR (2017)
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis
Resolving Braess's Paradox in Random Networks. Algorithmica 78 (3) (2017)
Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael C. Caramanis, Thanasis Lianeas, Emmanouil Pountourakis
A Submodular Approach for Electricity Distribution Network Reconfiguration. CoRR (2017)
Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen
Reconciling Selfish Routing with Social Good. SAGT (2017)
Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses
Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing. IJCAI (2016)
Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas
Improving Selfish Routing for Risk-Averse Players. WINE (2015)
Soumya Basu, Thanasis Lianeas, Evdokia Nikolova
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. WINE (2015)
Soumya Basu, Thanasis Lianeas, Evdokia Nikolova
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. CoRR (2015)
Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses
Asymptotically tight bounds for inefficiency in risk-averse selfish routing. CoRR (2015)
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis
On the hardness of network design for bottleneck routing games. Theor. Comput. Sci. 521 (2014)
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis
Resolving Braess's Paradox in Random Networks. WINE (2013)
Haris Angelidakis, Dimitris Fotakis, Thanasis Lianeas
Stochastic Congestion Games with Risk-Averse Players. SAGT (2013)
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis
On the Hardness of Network Design for Bottleneck Routing Games. SAGT (2012)
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis
On the Hardness of Network Design for Bottleneck Routing Games CoRR (2012)