Feb 22, 2023 · We study the problem of dividing indivisible chores among agents whose costs (for the chores) are supermodular set functions with binary marginals.
May 30, 2023 · We study the problem of dividing indivisible chores among agents whose costs (for the chores) are supermodular set functions with binary ...
Feb 22, 2023 · We study the problem of finding fair and efficient allocations of indivisible chores among agents with bi- nary supermodular cost functions. Our ...
May 29, 2023 · ABSTRACT. We study the problem of dividing indivisible chores among agents whose costs (for the chores) are supermodular set functions with.
Sep 7, 2024 · We study the problem of allocating indivisible chores among agents with binary supermodular cost functions. In other words, each chore has a ...
Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.
Mar 14, 2023 · We study the problem of allocating indivisible chores among agents with binary supermodular cost functions. In other words, each chore has a ...
Missing: Division | Show results with:Division
Fair chore division under binary supermodular costs. CoRR, abs/2302.11530, 2023. [11] Umang Bhaskar, A. R. Sricharan, and Rohit Vaish. On approximate envy- ...
In this paper, the main concern is the allocation of chores. We discuss this problem in two parts: divisible and indivisible.
This paper designs a simple sequential picking algorithm that solely relies on the agents' ordinal rankings of the items, which achieves an approximation ...