default search action
Thanasis Lianeas
Person information
- affiliation: National Technical University of Athens, Greece
- affiliation: Athens University of Economics and Business, Greece
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Sotirios Dimos
, Dimitris Fotakis, Thanasis Lianeas, Kyriakos Sergis:
Escaping Braess's paradox through approximate Caratheodory's theorem. Inf. Process. Lett. 179: 106289 (2023) - 2022
- [j5]José Correa
Network Pricing: How to Induce Optimal Flows Under Strategic Link Operators. Oper. Res. 70(1): 472-489 (2022) - 2020
- [j4]Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas
Improving Selfish Routing for Risk-Averse Players. Theory Comput. Syst. 64(2): 339-370 (2020) - [c13]Dimitris Fotakis
Node-Max-Cut and the Complexity of Equilibrium in Linear Weighted Congestion Games. ICALP 2020: 50:1-50:19 - [c12]Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. NeurIPS 2020 - [c11]Emmanouil V. Vlatakis-Gkaragkounis
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix. NeurIPS 2020 - [i9]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras:
No-regret learning and mixed Nash equilibria: They do not mix. CoRR abs/2010.09514 (2020) - [i8]Dimitris Fotakis, Thanasis Lianeas, Georgios Piliouras, Stratis Skoulakis:
Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent. CoRR abs/2011.02817 (2020)
2010 – 2019
- 2019
- [j3]Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses
Risk-Averse Selfish Routing. Math. Oper. Res. 44(1): 38-57 (2019) - [i7]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 abs/1911.08704 (2019) - 2018
- [c10]Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael Caramanis, Thanasis Lianeas, Emmanouil Pountourakis:
A Submodular Approach for Electricity Distribution Network Reconfiguration. HICSS 2018: 1-10 - [c9]Richard Cole, Thanasis Lianeas, Evdokia Nikolova:
When Does Diversity of Agent Preferences Improve Outcomes in Selfish Routing? IJCAI 2018: 173-179 - [c8]José 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: 375-392 - 2017
- [j2]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. Algorithmica 78(3): 788-818 (2017) - [c7]Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen:
Reconciling Selfish Routing with Social Good. SAGT 2017: 147-159 - [i6]Richard Cole, Thanasis Lianeas, Evdokia Nikolova:
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing? CoRR abs/1702.07806 (2017) - [i5]Soumya Basu, Ger Yang, Thanasis Lianeas, Evdokia Nikolova, Yitao Chen:
Reconciling Selfish Routing with Social Good. CoRR abs/1707.00208 (2017) - [i4]Ali Khodabakhsh, Ger Yang, Soumya Basu, Evdokia Nikolova, Michael C. Caramanis, Thanasis Lianeas, Emmanouil Pountourakis:
A Submodular Approach for Electricity Distribution Network Reconfiguration. CoRR abs/1711.03517 (2017) - 2016
- [c6]Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses:
Asymptotically Tight Bounds for Inefficiency in Risk-Averse Selfish Routing. IJCAI 2016: 338-344 - 2015
- [b1]Athanasios Lianeas:
Παίγνια συμφόρησης: στοχαστικές επεκτάσεις και τεχνικές μείωσης του τιμήματος της αναρχίας. National Technical University of Athens, Greece, 2015 - [c5]Soumya Basu, Thanasis Lianeas, Evdokia Nikolova:
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. WINE 2015: 89-103 - [c4]Dimitris Fotakis, Dimitris Kalimeris, Thanasis Lianeas:
Improving Selfish Routing for Risk-Averse Players. WINE 2015: 328-342 - [i3]Soumya Basu, Thanasis Lianeas, Evdokia Nikolova:
New Complexity Results and Algorithms for the Minimum Tollbooth Problem. CoRR abs/1509.07260 (2015) - [i2]Thanasis Lianeas, Evdokia Nikolova, Nicolás E. Stier Moses:
Asymptotically tight bounds for inefficiency in risk-averse selfish routing. CoRR abs/1510.02067 (2015) - 2014
- [j1]Dimitris Fotakis
On the hardness of network design for bottleneck routing games. Theor. Comput. Sci. 521: 107-122 (2014) - 2013
- [c3]Haris Angelidakis, Dimitris Fotakis, Thanasis Lianeas:
Stochastic Congestion Games with Risk-Averse Players. SAGT 2013: 86-97 - [c2]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
Resolving Braess's Paradox in Random Networks. WINE 2013: 188-201 - 2012
- [c1]Dimitris Fotakis
On the Hardness of Network Design for Bottleneck Routing Games. SAGT 2012: 156-167 - [i1]Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas, Paul G. Spirakis:
On the Hardness of Network Design for Bottleneck Routing Games. CoRR abs/1207.5212 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: