Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Home

Person

Alexandros Paul Hollender

This person has left EPFL

About
Privacy
Disclaimer

Graph Chatbot

Related publications (5)

Page 1 of 1

The Frontier of Intractability for EFX with Two Agents

Alexandros Paul 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 problem of computing an EFX allocation in the two-agent case and characterize th ...

Springer International Publishing Ag2023

Further Collapses in TFNP

Mika Tapani Göös, Gilbert Théodore Maystre, Siddhartha Jain, Alexandros Paul Hollender

We show EOPL = PLS \cap PsansP \sansP AD. Here the class EOPL consists of all total search problems that reduce to the END -OF -POTENTIAL -LINE problem, which was introduced in the works by Hub'acv \ek and Yogev (SICOMP 2020) and Fearnley et al. (JCSS 202 ...

Siam Publications2024

Separations in Proof Complexity and TFNP

Mika Tapani Göös, Gilbert Théodore Maystre, Siddhartha Jain, Alexandros Paul Hollender

ACM2022

Envy-Free Cake-Cutting for Four Agents

Alexandros Paul Hollender

In the envy-free cake-cutting problem we are given a resource, usually called a cake and represented as the [0, 1] interval, and a set of n agents with heterogeneous preferences over pieces of the cake. The goal is to divide the cake among the n agents suc ...

Ieee Computer Soc2023

Further Collapses in TFNP

Mika Tapani Göös, Gilbert Théodore Maystre, Alexandros Paul Hollender, Siddhartha Jain

We show EOPL = PLS ∩ PPAD. Here the class EOPL consists of all total search problems that reduce to the End-of-Potential-Line problem, which was introduced in the works by Hubáček and Yogev (SICOMP 2020) and Fearnley et al. (JCSS 2020). In particular, our ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022