128 citations · 451 across the 30 of their papers we have counts for
3 papers · 1 filter
An Improved Envy-Free Cake Cutting Protocol for Four Agents
Georgios Amanatidis, George Christodoulou, John Fearnley +3
We consider the classic cake-cutting problem of producing envy-free allocations, restricted to the case of four agents. The problem asks for a partition of the cake to four agents,…
Comparing Approximate Relaxations of Envy-Freeness
Georgios Amanatidis, Georgios Birmpas, Evangelos Markakis
In fair division problems with indivisible goods it is well known that one cannot have any guarantees for the classic fairness notions of envy-freeness and proportionality. As a re…
Rapid Mixing of the Switch Markov Chain for Strongly Stable Degree Sequences and 2-Class Joint Degree Matrices
Georgios Amanatidis, Pieter Kleer
The switch Markov chain has been extensively studied as the most natural Markov Chain Monte Carlo approach for sampling graphs with prescribed degree sequences. We use comparison a…