Thodoris Lykouris

Learn More
We show that learning algorithms satisfying a low approximate regret property experience fast convergence to approximate optimality in a large class of repeated games. Our property, which simply requires that each learner has small regret compared to a (1 + ✏)-multiplicative approximation to the best action in hindsight, is ubiquitous among learning(More)
We study the quality of outcomes in games when the population of players is dynamically changing, and where participants have to adapt to the dynamic environment. Price of Anarchy has originally been introduced to study the Nash equilibria of one-shot games. The Price of Total Anarchy extends this notion to learning outcomes in a repeated setting, assuming(More)
Optimizing shared vehicle systems (bike-sharing/car-sharing/ride-sharing) is more challenging compared to traditional resource allocation settings due to the presence of <i>complex network externalities</i>. In particular, changes in the demand/supply at any location (via dynamic pricing, rebalancing of empty vehicles, etc.) affect future supply throughout(More)
We study influence maximization problems over social networks, in the presence of competition. Our focus is on diffusion processes within the family of threshold models. Motivated by the general lack of positive results establishing monotonicity and submodularity of the influence function for threshold models, we introduce a general class of(More)
Optimizing shared vehicle systems (bike-sharing/car-sharing/ride-sharing) is more challenging compared to traditional resource allocation settings due to the presence of complex network externalities – changes in the demand/supply at any location affect future supply throughout the system within short timescales. These externalities are well captured by(More)
Main result This lecture is based on a result by Brendan Lucier and Alan Borodin [1]. The main result is the following: Theorem 1. If a greedy algorithm is a c-approximation in the optimization version of the problem then, in the game-theoretic version of the problem, it derives a Price of Anarchy of at most c with first price and (c + 1) with second price.(More)
  • 1