activity
20172026
most citedComputing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem

5 citations · 12 across the 11 of their papers we have counts for

collaborators
Showing 2020Show all

2 papers · 1 filter

cs.CC2020

Pizza Sharing is PPA-hard

Argyrios Deligkas, John Fearnley, Themistoklis Melissourgos

We study the computational complexity of finding a solution for the straight-cut and square-cut pizza sharing problems. We show that computing an -approximate solution…

cs.GT2020

Walrasian Equilibria in Markets with Small Demands

Argyrios Deligkas, Themistoklis Melissourgos, Paul G. Spirakis

We study the complexity of finding a Walrasian equilibrium in markets where the agents have -demand valuations. These valuations are an extension of unit-demand valuations where…