| No-regret learning and mixed nash equilibria: They do not mix EV Vlatakis-Gkaragkounis, L Flokas, T Lianeas, P Mertikopoulos, ... Advances in Neural Information Processing Systems 33, 1380-1391, 2020 | 48 | 2020 |
| No-regret learning and mixed Nash equilibria: They do not mix L Flokas, EV Vlatakis-Gkaragkounis, T Lianeas, P Mertikopoulos, ... arXiv preprint arXiv:2010.09514, 10, 2020 | 41 | 2020 |
| Stochastic congestion games with risk-averse players H Angelidakis, D Fotakis, T Lianeas International Symposium on Algorithmic Game Theory, 86-97, 2013 | 38 | 2013 |
| Asymptotically tight bounds for inefficiency in risk-averse selfish routing T Lianeas, E Nikolova, NE Stier-Moses arXiv preprint arXiv:1510.02067, 2015 | 23 | 2015 |
| Improving selfish routing for risk-averse players D Fotakis, D Kalimeris, T Lianeas International Conference on Web and Internet Economics, 328-342, 2015 | 22 | 2015 |
| Network pricing: How to induce optimal flows under strategic link operators J Correa, C Guzmán, T Lianeas, E Nikolova, M Schröder Proceedings of the 2018 ACM Conference on Economics and Computation, 375-392, 2018 | 19 | 2018 |
| Efficient online learning of optimal rankings: Dimensionality reduction via gradient descent D Fotakis, T Lianeas, G Piliouras, S Skoulakis Advances in Neural Information Processing Systems 33, 7816-7827, 2020 | 18 | 2020 |
| Risk-averse selfish routing T Lianeas, E Nikolova, NE Stier-Moses Mathematics of Operations Research 44 (1), 38-57, 2019 | 13 | 2019 |
| When does diversity of agent preferences improve outcomes in selfish routing? R Cole, T Lianeas, E Nikolova Proceedings of the 27th International Joint Conference on Artificial …, 2018 | 12 | 2018 |
| Resolving braess’s paradox in random networks D Fotakis, AC Kaporis, T Lianeas, PG Spirakis Algorithmica 78, 788-818, 2017 | 12 | 2017 |
| A submodular approach for electricity distribution network reconfiguration A Khodabakhsh, G Yang, S Basu, E Nikolova, MC Caramanis, T Lianeas, ... arXiv preprint arXiv:1711.03517, 2017 | 11 | 2017 |
| Reconciling selfish routing with social good S Basu, G Yang, T Lianeas, E Nikolova, Y Chen International Symposium on Algorithmic Game Theory, 147-159, 2017 | 7 | 2017 |
| New complexity results and algorithms for the minimum tollbooth problem S Basu, T Lianeas, E Nikolova International Conference on Web and Internet Economics, 89-103, 2015 | 7 | 2015 |
| Node-max-cut and the complexity of equilibrium in linear weighted congestion games D Fotakis, V Kandiros, T Lianeas, N Mouzakis, P Patsilinakos, S Skoulakis 47th International Colloquium on Automata, Languages, and Programming (ICALP …, 2020 | 3 | 2020 |
| On the hardness of network design for bottleneck routing games D Fotakis, AC Kaporis, T Lianeas, PG Spirakis International Symposium on Algorithmic Game Theory, 156-167, 2012 | 3 | 2012 |
| When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? R Cole, T Lianeas, E Nikolova arXiv preprint arXiv:1702.07806, 2017 | 2 | 2017 |
| On the hardness of network design for bottleneck routing games D Fotakis, AC Kaporis, T Lianeas, PG Spirakis Theoretical Computer Science 521, 107-122, 2014 | 2 | 2014 |
| Escaping Braess's paradox through approximate Caratheodory's theorem S Dimos, D Fotakis, T Lianeas, K Sergis Information Processing Letters 179, 106289, 2023 | 1 | 2023 |
| Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games D Fotakis, V Kandiros, T Lianeas, N Mouzakis, P Patsilinakos, S Skoulakis arXiv preprint arXiv:1911.08704, 2019 | | 2019 |
| When does diversity of user preferences improve outcomes in selfish routing? T Lianeas, E Nikolova, R Cole | | |
