Year: 2025
Type: preprint
Abstract: We study the fair allocation problem of indivisible items with subsidy. In this paper, we focus on the notion of fairness - equitability (EQ), which requires that items be allocated such that all agents value the bundle they receive equally. First, we study the upper bounds of the minimum required subsidy to achieve EQ in different item settings and provide the corresponding lower bounds. Second, we consider the bounded subsidy for achieving EQ and another popular notion of fairness - envy-freeness (EF), and give a characterization of allocations that can achieve both EQ and EF. Finally, we analyze the bounds of subsidy of allocations achieving fairness and efficiency (utilitarian social welfare or Nash welfare) and design several polynomial-time algorithms to compute the desired allocation.
Source: arXiv (Cornell University)
Authors: Wang, Yuanyuan, Wei, Tianze
Institutions: Ocean University of China, City University of Hong Kong
Language: English
Subfield: Economics and Econometrics
Domain: Social Sciences
SDG: Reduced inequalities
Open Access status: green
OpenAlex ID: W4416610286
Cites:
Cited by:
Related to: