Thanasis Lianeas
Thanasis Lianeas
Unknown affiliation
Verified email at corelab.ntua.gr
Title
Cited by
Cited by
Year
Stochastic congestion games with risk-averse players
H Angelidakis, D Fotakis, T Lianeas
International Symposium on Algorithmic Game Theory, 86-97, 2013
262013
Asymptotically tight bounds for inefficiency in risk-averse selfish routing
T Lianeas, E Nikolova, NE Stier-Moses
arXiv preprint arXiv:1510.02067, 2015
192015
Improving selfish routing for risk-averse players
D Fotakis, D Kalimeris, T Lianeas
International Conference on Web and Internet Economics, 328-342, 2015
172015
Resolving braess’s paradox in random networks
D Fotakis, AC Kaporis, T Lianeas, PG Spirakis
Algorithmica 78 (3), 788-818, 2017
92017
When does diversity of agent preferences improve outcomes in selfish routing?
R Cole, T Lianeas, E Nikolova
IJCAI, 173-179, 2018
72018
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
72017
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
62018
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
52015
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
42014
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
32017
Risk-averse selfish routing
T Lianeas, E Nikolova, NE Stier-Moses
Mathematics of Operations Research 44 (1), 38-57, 2019
22019
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing?
R Cole, T Lianeas, E Nikolova
arXiv preprint arXiv:1702.07806, 2017
12017
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
2020
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
NO-REGRET LEARNING AND MIXED NASH EQUILIBRIA: THEY DO NOT MIX
L FLOKAS, EV VLATAKIS-GKARAGKOUNIS, T LIANEAS, ...
When does diversity of user preferences improve outcomes in selfish routing?
T Lianeas, E Nikolova, R Cole
The system can't perform the operation now. Try again later.
Articles 1–16