3 problems

Let an instance consist of $n$ agents and $m$ items. A symEF$(n-1)$ allocation is an allocation satisfying symmetric envy-freeness up to $n-1$ items. SymEF$(n-1)$ existence conject…

Consider instances with a fixed number $n$ of agents and $m$ items, with probability taken over the paper's instance model. A symEF1 allocation is an allocation satisfying symmetri…

Let an instance consist of $n$ agents and $m$ distinct items, and let a symEF1 allocation mean an allocation satisfying symmetric envy-freeness up to one item. Assume that $m>n$. M…