activity
20152026
most citedLearning in Games: Robustness of Fast Convergence

44 citations · 128 across the 20 of their papers we have counts for

collaborators

25 papers

cs.SI2026

Optimal Exploration of New Products under Assortment Decisions

Jackie Baek, Atanas Dinev, Thodoris Lykouris

We study online learning for new products on a platform that makes capacity-constrained assortment decisions on which products to offer. For a newly listed product, its quality is…

cs.GT2026

Human-AI Productivity Paradoxes: Modeling the Interplay of Skill, Effort, and AI Assistance

Ali Aouad, Thodoris Lykouris, Huiying Zhong

Generative Artificial Intelligence (AI) tools are rapidly adopted in the workplace and in education, yet the empirical evidence on AI's impact remains mixed across different operat…

cs.LG2025

Contextual Dynamic Pricing with Heterogeneous Buyers

Thodoris Lykouris, Sloan Nietert, Princewill Okoroafor +2

We initiate the study of contextual dynamic pricing with a heterogeneous population of buyers, where a seller repeatedly posts prices (over rounds) that depend on the observabl…

cs.DS2025

Scheduling in Queueing Systems with Uncertain and Evolving Holding Costs

Caner Gocmen, Thodoris Lykouris, Deeksha Sinha +1

In content moderation for social media platforms, the cost of delaying the review of a content is proportional to its view trajectory, which fluctuates and is apriori unknown. Moti…

cs.GT2024★ 1 cited

Social Learning with Limited Attention: Negative Reviews Persist under Newest First

Jackie Baek, Atanas Dinev, Thodoris Lykouris

We study a model of social learning from reviews where customers are computationally limited and make purchases based on reading only the first few reviews displayed by the platfor…

cs.LG2024★ 4 cited

Learning to Defer in Congested Systems: The AI-Human Interplay

Thodoris Lykouris, Wentao Weng

High-stakes applications rely on combining Artificial Intelligence (AI) and humans for responsive and reliable decision making. For example, content moderation in social media plat…

cs.LG2023★ 1 cited

The Transient Cost of Learning in Queueing Systems

Daniel Freund, Thodoris Lykouris, Wentao Weng

Queueing systems are widely applicable stochastic models with use cases in communication networks, healthcare, service systems, etc. Although their optimal control has been extensi…

cs.GT2023★ 2 cited

Group fairness in dynamic refugee assignment

Daniel Freund, Thodoris Lykouris, Elisabeth Paulson +2

Ensuring that refugees and asylum seekers thrive (e.g., find employment) in their host countries is a profound humanitarian goal, and a primary driver of employment is the geograph…

cs.GT2022

Learning in Stackelberg Games with Non-myopic Agents

Nika Haghtalab, Thodoris Lykouris, Sloan Nietert +1

We study Stackelberg games where a principal repeatedly interacts with a non-myopic long-lived agent, without knowing the agent's payoff function. Although learning in Stackelberg…

cs.LG2022★ 3 cited

Efficient decentralized multi-agent learning in asymmetric bipartite queueing systems

Daniel Freund, Thodoris Lykouris, Wentao Weng

We study decentralized multi-agent learning in bipartite queueing systems, a standard model for service systems. In particular, N agents request service from K servers in a fully d…

cs.LG2021★ 10 cited

Bayesian decision-making under misspecified priors with applications to meta-learning

Max Simchowitz, Christopher Tosh, Akshay Krishnamurthy +4

Thompson sampling and other Bayesian sequential decision-making algorithms are among the most popular approaches to tackle explore/exploit trade-offs in (contextual) bandits. The c…

cs.GT2020★ 3 cited

Static pricing for multi-unit prophet inequalities

Shuchi Chawla, Nikhil Devanur, Thodoris Lykouris

We study a pricing problem where a seller has identical copies of a product, buyers arrive sequentially, and the seller prices the items aiming to maximize social welfare. When…

cs.LG2020★ 13 cited

Constrained episodic reinforcement learning in concave-convex and knapsack settings

Kianté Brantley, Miroslav Dudik, Thodoris Lykouris +4

We propose an algorithm for tabular episodic reinforcement learning with constraints. We provide a modular analysis with strong theoretical guarantees for settings with concave rew…

cs.LG2020★ 3 cited

Bandits with adversarial scaling

Thodoris Lykouris, Vahab Mirrokni, Renato Paes Leme

We study "adversarial scaling", a multi-armed bandit model where rewards have a stochastic and an adversarial component. Our model captures display advertising where the "click-thr…

cs.LG2020

Contextual Search in the Presence of Adversarial Corruptions

Akshay Krishnamurthy, Thodoris Lykouris, Chara Podimata +1

We study contextual search, a generalization of binary search in higher dimensions, which captures settings such as feature-based dynamic pricing. Standard formulations of this pro…

cs.LG2019★ 18 cited

Corruption-robust exploration in episodic reinforcement learning

Thodoris Lykouris, Max Simchowitz, Aleksandrs Slivkins +1

We initiate the study of multi-stage episodic reinforcement learning under adversarial corruptions in both the rewards and the transition probabilities of the underlying system ext…

cs.LG2019

Advancing subgroup fairness via sleeping experts

Avrim Blum, Thodoris Lykouris

We study methods for improving fairness to subgroups in settings with overlapping populations and sequential predictions. Classical notions of fairness focus on the balance of some…

cs.LG2019★ 4 cited

Feedback graph regret bounds for Thompson Sampling and UCB

Thodoris Lykouris, Eva Tardos, Drishti Wali

We study the stochastic multi-armed bandit problem with the graph-based feedback structure introduced by Mannor and Shamir. We analyze the performance of the two most prominent sto…

cs.LG2018★ 17 cited

On preserving non-discrimination when combining expert advice

Avrim Blum, Suriya Gunasekar, Thodoris Lykouris +1

We study the interplay between sequential decision making and avoiding discrimination against protected groups, when examples arrive online and do not follow distributional assumpt…

cs.LG2018★ 5 cited

Stochastic bandits robust to adversarial corruptions

Thodoris Lykouris, Vahab Mirrokni, Renato Paes Leme

We introduce a new model of stochastic bandits with adversarial corruptions which aims to capture settings where most of the input follows a stochastic pattern but some fraction of…

cs.DS2018

Competitive caching with machine learned advice

Thodoris Lykouris, Sergei Vassilvitskii

Traditional online algorithms encapsulate decision making under uncertainty, and give ways to hedge against all possible future events, while guaranteeing a nearly optimal solution…

cs.LG2017

Small-loss bounds for online learning with partial information

Thodoris Lykouris, Karthik Sridharan, Eva Tardos

We consider the problem of adversarial (non-stochastic) online learning with partial information feedback, where at each round, a decision maker selects an action from a finite set…

cs.GT2016

Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework

Siddhartha Banerjee, Daniel Freund, Thodoris Lykouris

Optimizing shared vehicle systems (bike/scooter/car/ride-sharing) is more challenging compared to traditional resource allocation settings due to the presence of \emph{complex netw…

cs.GT2016★ 44 cited

Learning in Games: Robustness of Fast Convergence

Dylan J. Foster, Zhiyuan Li, Thodoris Lykouris +2

We show that learning algorithms satisfying a property experience fast convergence to approximate optimality in a large class of repeated games. O…