2 citations · 3 across the 2 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2023★ 1 cited
Round-Robin Beyond Additive Agents: Existence and Fairness of Approximate Equilibria
Georgios Amanatidis, Georgios Birmpas, Philip Lazos +2
Fair allocation of indivisible goods has attracted extensive attention over the last two decades, yielding numerous elegant algorithmic results and producing challenging open quest…
cs.GT2016★ 2 cited
Coverage, Matching, and Beyond: New Results on Budgeted Mechanism Design
Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
We study a type of reverse (procurement) auction problems in the presence of budget constraints. The general algorithmic problem is to purchase a set of resources, which come at a…