Thanasis Lianeas

Orcid: 0000-0001-8386-5912

Affiliations:
  • National Technical University of Athens, Greece
  • Athens University of Economics and Business, Greece


According to our database1, Thanasis Lianeas authored at least 18 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Escaping Braess's paradox through approximate Caratheodory's theorem.
Inf. Process. Lett., 2023

2022
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators.
Oper. Res., 2022

2020
Improving Selfish Routing for Risk-Averse Players.
Theory Comput. Syst., 2020

No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Risk-Averse Selfish Routing.
Math. Oper. Res., 2019

Node Max-Cut and Computing Equilibria in Linear Weighted Congestion Games.
CoRR, 2019

2018
When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing?
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Submodular Approach for Electricity Distribution Network Reconfiguration.
Proceedings of the 51st Hawaii International Conference on System Sciences, 2018

2017
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing?
CoRR, 2017

Resolving Braess's Paradox in Random Networks.
Algorithmica, 2017

Reconciling Selfish Routing with Social Good.
Proceedings of the Algorithmic Game Theory - 10th International Symposium, 2017

2016
Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας
PhD thesis, 2015

New Complexity Results and Algorithms for the Minimum Tollbooth Problem.
Proceedings of the Web and Internet Economics - 11th International Conference, 2015

2014
On the hardness of network design for bottleneck routing games.
Theor. Comput. Sci., 2014

2013
Stochastic Congestion Games with Risk-Averse Players.
Proceedings of the Algorithmic Game Theory - 6th International Symposium, 2013


  Loading...