Weighted notions of fairness with binary supermodular chores
V Viswanathan, Y Zick - arXiv preprint arXiv:2303.06212, 2023 - arxiv.org
arXiv preprint arXiv:2303.06212, 2023•arxiv.org
We study the problem of allocating indivisible chores among agents with binary
supermodular cost functions. In other words, each chore has a marginal cost of $0 $ or $1 $
and chores exhibit increasing marginal costs (or decreasing marginal utilities). In this note,
we combine the techniques of Viswanathan and Zick (2022) and Barman et al.(2023) to
present a general framework for fair allocation with this class of valuation functions. Our
framework allows us to generalize the results of Barman et al.(2023) and efficiently compute …
supermodular cost functions. In other words, each chore has a marginal cost of $0 $ or $1 $
and chores exhibit increasing marginal costs (or decreasing marginal utilities). In this note,
we combine the techniques of Viswanathan and Zick (2022) and Barman et al.(2023) to
present a general framework for fair allocation with this class of valuation functions. Our
framework allows us to generalize the results of Barman et al.(2023) and efficiently compute …
We study the problem of allocating indivisible chores among agents with binary supermodular cost functions. In other words, each chore has a marginal cost of or and chores exhibit increasing marginal costs (or decreasing marginal utilities). In this note, we combine the techniques of Viswanathan and Zick (2022) and Barman et al. (2023) to present a general framework for fair allocation with this class of valuation functions. Our framework allows us to generalize the results of Barman et al. (2023) and efficiently compute allocations which satisfy weighted notions of fairness like weighted leximin or min weighted -mean malfare for any .
arxiv.org
以上显示的是最相近的搜索结果。 查看全部搜索结果