13 citations · 26 across the 10 of their papers we have counts for
9 papers · 1 filter
EFX Allocation In (Multi)Hypergraphs
Thanasis Lianeas, Alkmini Sgouritsa, Minas Marios Sotiriou
We study fair allocations of indivisible goods among agents with heterogeneous monotone valuations. As fair we consider the allocations that are envy-free-up-to-any-good (EFX). Fin…
Almost EFX in Hypergraphs
Ioannis Kakatelis, Thanasis Lianeas, Alkmini Sgouritsa +1
We study the existence of envy-free-up-to-any-good (EFX) allocations of indivisible goods among agents with heterogeneous monotone valuations. Christodoulou et al. (2023) introduce…
Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem
Thanasis Lianeas, Marios Mertzanidis, Aikaterini Nikolidaki
In Facility Location problems there are agents that should be connected to facilities and locations where facilities may be opened so that agents can connect to them. We depart fro…
No-regret learning and mixed Nash equilibria: They do not mix
Lampros Flokas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Thanasis Lianeas +2
Understanding the behavior of no-regret dynamics in general -player games is a fundamental question in online learning and game theory. A folk result in the field states that, i…
Reconciling Selfish Routing with Social Good
Soumya Basu, Ger Yang, Thanasis Lianeas +2
Selfish routing is a central problem in algorithmic game theory, with one of the principal applications being that of routing in road networks. Inspired by the emergence of routing…
When Does Diversity of User Preferences Improve Outcomes in Selfish Routing?
Richard Cole, Thanasis Lianeas, Evdokia Nikolova
We seek to understand when heterogeneity in user preferences yields improved outcomes in terms of overall cost. That this might be hoped for is based on the common belief that dive…
Asymptotically tight bounds for inefficiency in risk-averse selfish routing
Thanasis Lianeas, Evdokia Nikolova, Nicolas E. Stier-Moses
We consider a nonatomic selfish routing model with independent stochastic travel times, represented by mean and variance latency functions for each edge that depend on their flows.…
New Complexity Results and Algorithms for the Minimum Tollbooth Problem
Soumya Basu, Thanasis Lianeas, Evdokia Nikolova
The inefficiency of the Wardrop equilibrium of nonatomic routing games can be eliminated by placing tolls on the edges of a network so that the socially optimal flow is induced as…
On the Hardness of Network Design for Bottleneck Routing Games
Dimitris Fotakis, Alexis C. Kaporis, Thanasis Lianeas +1
In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess'…