5 citations · 13 across the 19 of their papers we have counts for
5 papers · 1 filter
PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh +1
We introduce a general technique for proving membership of search problems with exact rational solutions in PPAD, one of the most well-known classes containing total search problem…
The Complexity of Computing KKT Solutions of Quadratic Programs
John Fearnley, Paul W. Goldberg, Alexandros Hollender +1
It is well known that solving a (non-convex) quadratic program is NP-hard. We show that the problem remains hard even if we are only looking for a Karush-Kuhn-Tucker (KKT) point, i…
Envy-Free Cake-Cutting for Four Agents
Alexandros Hollender, Aviad Rubinstein
In the envy-free cake-cutting problem we are given a resource, usually called a cake and represented as the interval, and a set of agents with heterogeneous preferences…
The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
Alexandros Hollender, Manolis Zampetakis
Finding approximate stationary points, i.e., points where the gradient is approximately zero, of non-convex but smooth objective functions over unrestricted -dimensional dom…
The Frontier of Intractability for EFX with Two Agents
Paul W. Goldberg, Kasper Høgh, Alexandros Hollender
We consider the problem of sharing a set of indivisible goods among agents in a fair manner, namely such that the allocation is envy-free up to any good (EFX). We focus on the prob…