ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Given a finite set of indivisible items MM, agents N={1,…,n}N=\{1,\ldots,n\} with positive entitlements wi>0w_i>0, and additive valuations vi:2M→Rv_i:2^M\to\mathbb{R}, does there always exist a complete allocation (A1,…,An)(A_1,\ldots,A_n) of MM such that, for every pair of agents i,ji,j, there is an item o∈Ai∪Ajo\in A_i\cup A_j satisfying vi(Ai∖{o})wi≥vi(Aj∖{o})wj\frac{v_i(A_i\setminus\{o\})}{w_i}\geq\frac{v_i(A_j\setminus\{o\})}{w_j}, where removing oo affects only the bundle to which it belongs? Moreover, does such a complete weighted-envy-free-up-to-one-item allocation always admit a polynomial-time construction?

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.