Existence of weighted envy-freeness up to one item (WEF1)
Statement
Given a finite set of indivisible items , agents with positive entitlements , and additive valuations , does there always exist a complete allocation of such that, for every pair of agents , there is an item satisfying , where removing 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
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.