We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
We study the problem of fair division when the set of resources contains both divisible
and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness
up to one good (EF1) cannot be directly applied to this mixed goods setting. In this
work, we propose a new fairness notion, envy-freeness for mixed goods (EFM), which is a
direct generalization of both EF and EF1 to the mixed goods setting. We prove that an
EFM allocation always exists for any number of agents with additive valuations. We also
propose efficient algorithms to compute an EFM allocation for two agents with general
additive valuations and for n agents with piecewise linear valuations over the divisible
goods. Finally, we relax the envy-freeness requirement, instead asking for ε-envy-freeness
for mixed goods (ε-EFM), and present an efficient algorithm that finds an ε-EFM allocation.Ministry of Education (MOE)This work is supported in part by the Ministry of Education, Singapore, under its Academic Research Fund Tier 1 (RG23/20), and by an RGC grant (HKU 17203717E)
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.