3 citations · 3 across the 2 of their papers we have counts for
4 papers
Improved Price of Anarchy via Predictions
Vasilis Gkatzelis, Kostas Kollias, Alkmini Sgouritsa +1
A central goal in algorithmic game theory is to analyze the performance of decentralized multiagent systems, like communication and information networks. In the absence of a centra…
Resource-Aware Cost-Sharing Mechanisms with Priors
Vasilis Gkatzelis, Emmanouil Pountourakis, Alkmini Sgouritsa
In a decentralized system with machines, we study the selfish scheduling problem where each user strategically chooses which machine to use. Each machine incurs a cost, which i…
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…
A Little Charity Guarantees Almost Envy-Freeness
Bhaskar Ray Chaudhury, Tellikepalli Kavitha, Kurt Mehlhorn +1
Fair division of indivisible goods is a very well-studied problem. The goal of this problem is to distribute goods to agents in a "fair" manner, where every agent has a val…