default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThodoris Lykouris
Person information
- affiliation: MIT. Cambridge, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Daniel Freund
, Thodoris Lykouris, Wentao Weng:
Efficient Decentralized Multi-agent Learning in Asymmetric Bipartite Queueing Systems. Oper. Res. 72(3): 1049-1070 (2024)- [j5]Shuchi Chawla, Nikhil R. Devanur, Thodoris Lykouris:
Static Pricing for Multi-unit Prophet Inequalities. Oper. Res. 72(4): 1388-1399 (2024) - [i21]Thodoris Lykouris, Wentao Weng:
Learning to Defer in Content Moderation: The Human-AI Interplay. CoRR abs/2402.12237 (2024) - [i20]Jackie Baek, Atanas Dinev, Thodoris Lykouris:
Social Learning with Bounded Rationality: Negative Reviews Persist under Newest First. CoRR abs/2406.06929 (2024) - 2023
- [j4]Akshay Krishnamurthy, Thodoris Lykouris, Chara Podimata, Robert E. Schapire:
Contextual Search in the Presence of Adversarial Corruptions. Oper. Res. 71(4): 1120-1135 (2023) - [c20]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Quantifying the Cost of Learning in Queueing Systems. NeurIPS 2023 - [c19]Daniel Freund, Thodoris Lykouris, Elisabeth Paulson, Bradley Sturt, Wentao Weng:
Group fairness in dynamic refugee assignment. EC 2023: 701 - [i19]Daniel Freund, Thodoris Lykouris, Elisabeth Paulson, Bradley Sturt, Wentao Weng:
Group fairness in dynamic refugee assignment. CoRR abs/2301.10642 (2023) - [i18]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Quantifying the Cost of Learning in Queueing Systems. CoRR abs/2308.07817 (2023) - 2022
- [j3]Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris:
Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework. Oper. Res. 70(3): 1783-1805 (2022) - [j2]Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Small-Loss Bounds for Online Learning with Partial Information. Math. Oper. Res. 47(3): 2186-2218 (2022) - [c18]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Efficient decentralized multi-agent learning in asymmetric queuing systems. COLT 2022: 4080-4084 - [c17]Nika Haghtalab, Thodoris Lykouris, Sloan Nietert, Alexander Wei:
Learning in Stackelberg Games with Non-myopic Agents. EC 2022: 917-918 - [i17]Daniel Freund, Thodoris Lykouris, Wentao Weng:
Efficient decentralized multi-agent learning in asymmetric queuing systems. CoRR abs/2206.03324 (2022) - [i16]Nika Haghtalab, Thodoris Lykouris, Sloan Nietert, Alex Wei:
Learning in Stackelberg Games with Non-myopic Agents. CoRR abs/2208.09407 (2022) - 2021
- [j1]Thodoris Lykouris, Sergei Vassilvitskii:
Competitive Caching with Machine Learned Advice. J. ACM 68(4): 24:1-24:25 (2021) - [c16]Thodoris Lykouris, Max Simchowitz, Alex Slivkins, Wen Sun:
Corruption-robust exploration in episodic reinforcement learning. COLT 2021: 3242-3245 - [c15]Max Simchowitz, Christopher Tosh, Akshay Krishnamurthy, Daniel J. Hsu, Thodoris Lykouris, Miroslav Dudík, Robert E. Schapire:
Bayesian decision-making under misspecified priors with applications to meta-learning. NeurIPS 2021: 26382-26394 - [c14]Akshay Krishnamurthy, Thodoris Lykouris, Chara Podimata, Robert E. Schapire:
Contextual search in the presence of irrational agents. STOC 2021: 910-918 - [c13]Shuchi Chawla, Nikhil R. Devanur, Thodoris Lykouris:
Static Pricing for Multi-unit Prophet Inequalities (Extended Abstract). WINE 2021: 545-546 - [i15]Max Simchowitz, Christopher Tosh, Akshay Krishnamurthy, Daniel Hsu, Thodoris Lykouris, Miroslav Dudík, Robert E. Schapire:
Bayesian decision-making under misspecified priors with applications to meta-learning. CoRR abs/2107.01509 (2021) - 2020
- [c12]Thodoris Lykouris, Éva Tardos, Drishti Wali:
Feedback graph regret bounds for Thompson Sampling and UCB. ALT 2020: 592-614 - [c11]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with Adversarial Scaling. ICML 2020: 6511-6521 - [c10]Avrim Blum, Thodoris Lykouris:
Advancing Subgroup Fairness via Sleeping Experts. ITCS 2020: 55:1-55:24 - [c9]Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun:
Constrained episodic reinforcement learning in concave-convex and knapsack settings. NeurIPS 2020 - [i14]Akshay Krishnamurthy, Thodoris Lykouris, Chara Podimata:
Corrupted Multidimensional Binary Search: Learning in the Presence of Irrational Agents. CoRR abs/2002.11650 (2020) - [i13]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Bandits with adversarial scaling. CoRR abs/2003.02287 (2020) - [i12]Kianté Brantley, Miroslav Dudík, Thodoris Lykouris, Sobhan Miryoosefi, Max Simchowitz, Aleksandrs Slivkins, Wen Sun:
Constrained episodic reinforcement learning in concave-convex and knapsack settings. CoRR abs/2006.05051 (2020) - [i11]Shuchi Chawla, Nikhil R. Devanur, Thodoris Lykouris:
Static pricing for multi-unit prophet inequalities. CoRR abs/2007.07990 (2020)
2010 – 2019
- 2019
- [i10]Thodoris Lykouris, Éva Tardos, Drishti Wali:
Graph regret bounds for Thompson Sampling and UCB. CoRR abs/1905.09898 (2019) - [i9]Avrim Blum, Thodoris Lykouris:
Advancing subgroup fairness via sleeping experts. CoRR abs/1909.08375 (2019) - [i8]Thodoris Lykouris, Max Simchowitz, Aleksandrs Slivkins, Wen Sun:
Corruption Robust Exploration in Episodic Reinforcement Learning. CoRR abs/1911.08689 (2019) - 2018
- [c8]Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Small-loss bounds for online learning with partial information. COLT 2018: 979-986 - [c7]Thodoris Lykouris, Sergei Vassilvitskii:
Competitive Caching with Machine Learned Advice. ICML 2018: 3302-3311 - [c6]Avrim Blum, Suriya Gunasekar, Thodoris Lykouris, Nati Srebro:
On preserving non-discrimination when combining expert advice. NeurIPS 2018: 8386-8397 - [c5]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Stochastic bandits robust to adversarial corruptions. STOC 2018: 114-122 - [i7]Thodoris Lykouris, Sergei Vassilvitskii:
Competitive caching with machine learned advice. CoRR abs/1802.05399 (2018) - [i6]Thodoris Lykouris, Vahab S. Mirrokni, Renato Paes Leme:
Stochastic bandits robust to adversarial corruptions. CoRR abs/1803.09353 (2018) - [i5]Avrim Blum, Suriya Gunasekar, Thodoris Lykouris, Nathan Srebro:
On preserving non-discrimination when combining expert advice. CoRR abs/1810.11829 (2018) - 2017
- [c4]Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris:
Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework. EC 2017: 517 - [i4]Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Small-loss bounds for online learning with partial information. CoRR abs/1711.03639 (2017) - 2016
- [c3]Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Learning in Games: Robustness of Fast Convergence. NIPS 2016: 4727-4735 - [c2]Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos:
Learning and Efficiency in Games with Dynamic Population. SODA 2016: 120-129 - [i3]Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris, Karthik Sridharan, Éva Tardos:
Fast Convergence of Common Learning Algorithms in Games. CoRR abs/1606.06244 (2016) - [i2]Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris:
Multi-objective pricing for shared vehicle systems. CoRR abs/1608.06819 (2016) - 2015
- [i1]Thodoris Lykouris, Vasilis Syrgkanis, Éva Tardos:
Learning and Efficiency in Games with Dynamic Population. CoRR abs/1505.00391 (2015) - 2014
- [c1]Dimitris Fotakis, Thodoris Lykouris, Evangelos Markakis, Svetlana Obraztsova:
Influence Maximization in Switching-Selection Threshold Models. SAGT 2014: 122-133
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-10-23 21:22 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:
