activity
20102026
most citedOnline Nash Social Welfare Maximization with Predictions

10 citations · 33 across the 32 of their papers we have counts for

collaborators
Showing 2020Show all

5 papers · 1 filter

cs.GT2020★ 1 cited

Fair and Efficient Online Allocations with Normalized Valuations

Vasilis Gkatzelis, Alexandros Psomas, Xizhi Tan

A set of divisible resources becomes available over a sequence of rounds and needs to be allocated immediately and irrevocably. Our goal is to distribute these resources to maximiz…

cs.GT2020

Achieving Proportionality up to the Maximin Item with Indivisible Goods

Artem Baklanov, Pranav Garimidi, Vasilis Gkatzelis +1

We study the problem of fairly allocating indivisible goods and focus on the classic fairness notion of proportionality. The indivisibility of the goods is long known to pose highl…

cs.GT2020★ 10 cited

Online Nash Social Welfare Maximization with Predictions

Siddhartha Banerjee, Vasilis Gkatzelis, Artur Gorokh +1

We consider the problem of allocating a set of divisible goods to agents in an online manner, aiming to maximize the Nash social welfare, a widely studied objective which provi…

cs.GT2020★ 3 cited

Resource-Aware Protocols for Network Cost-Sharing Games

George Christodoulou, Vasilis Gkatzelis, Mohamad Latifian +1

We study the extent to which decentralized cost-sharing protocols can achieve good price of anarchy (PoA) bounds in network cost-sharing games with agents. We focus on the mode…

cs.GT2020

Resolving the Optimal Metric Distortion Conjecture

Vasilis Gkatzelis, Daniel Halpern, Nisarg Shah

We study the following metric distortion problem: there are two finite sets of points, and , that lie in the same metric space, and our goal is to choose a point in whos…