Stochastic Congestion Games with Risk-Averse Players. - Haris Angelidakis; Dimitris Fotakis 001; Thanasis Lianeas (SAGT, 2013)

On the hardness of network design for bottleneck routing games. - Dimitris Fotakis 001; Alexis C. Kaporis; Thanasis Lianeas; Paul G. Spirakis (Theor. Comput. Sci., 2014)

New Complexity Results and Algorithms for the Minimum Tollbooth Problem. - Soumya Basu 001; Thanasis Lianeas; Evdokia Nikolova (WINE, 2015)

Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας - Athanasios Lianeas (2015)

Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing. - Thanasis Lianeas; Evdokia Nikolova; Nicolás E. Stier Moses (IJCAI, 2016)

Reconciling Selfish Routing with Social Good. - Soumya Basu 001; Ger Yang; Thanasis Lianeas; Evdokia Nikolova; Yitao Chen (SAGT, 2017)

Resolving Braess's Paradox in Random Networks. - Dimitris Fotakis 001; Alexis C. Kaporis; Thanasis Lianeas; Paul G. Spirakis (Algorithmica, 2017)

When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? - Richard Cole 001; Thanasis Lianeas; Evdokia Nikolova (CoRR, 2017)

A Submodular Approach for Electricity Distribution Network Reconfiguration. - Ali Khodabakhsh 002; Ger Yang; Soumya Basu 001; Evdokia Nikolova; Michael Caramanis; Thanasis Lianeas; Emmanouil Pountourakis (HICSS, 2018)

When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? - Richard Cole 001; Thanasis Lianeas; Evdokia Nikolova (IJCAI, 2018)

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games. - Dimitris Fotakis 001; Anthimos Vardis Kandiros; Thanasis Lianeas; Nikos Mouzakis; Panagiotis Patsilinakos; Stratis Skoulakis (CoRR, 2019)

Risk-Averse Selfish Routing. - Thanasis Lianeas; Evdokia Nikolova; Nicolás E. Stier Moses (Math. Oper. Res., 2019)

Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. - Dimitris Fotakis 001; Anthimos Vardis Kandiros; Thanasis Lianeas; Nikos Mouzakis; Panagiotis Patsilinakos; Stratis Skoulakis (ICALP, 2020)

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. - Dimitris Fotakis 001; Thanasis Lianeas; Georgios Piliouras; Stratis Skoulakis (NeurIPS, 2020)

No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix. - Emmanouil V. Vlatakis-Gkaragkounis; Lampros Flokas; Thanasis Lianeas; Panayotis Mertikopoulos; Georgios Piliouras (NeurIPS, 2020)

Improving Selfish Routing for Risk-Averse Players. - Dimitris Fotakis 001; Dimitris Kalimeris; Thanasis Lianeas (Theory Comput. Syst., 2020)

Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. - José Correa 001; Cristóbal Guzmán; Thanasis Lianeas; Evdokia Nikolova; Marc Schröder 002 (Oper. Res., 2022)

Escaping Braess's paradox through approximate Caratheodory's theorem. - Sotirios Dimos; Dimitris Fotakis 001; Thanasis Lianeas; Kyriakos Sergis (Inf. Process. Lett., 2023)