TY - JOUR
T1 - A fair and truthful mechanism with limited subsidy
AU - Goko, Hiromichi
AU - Igarashi, Ayumi
AU - Kawase, Yasushi
AU - Makino, Kazuhisa
AU - Sumita, Hanna
AU - Tamura, Akihisa
AU - Yokoi, Yu
AU - Yokoo, Makoto
N1 - Publisher Copyright:
© 2024 Elsevier Inc.
PY - 2024/3
Y1 - 2024/3
N2 - The notion of envy-freeness is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are not guaranteed to exist. Classical works have avoided this issue by introducing an additional divisible resource, i.e., money. In this paper, we aim to design a truthful allocation mechanism of indivisible goods to achieve fairness and efficiency criteria with a limited amount of subsidy. Following the work of Halpern and Shah, our central question is as follows: to what extent do we need to rely on the power of money to accomplish these objectives? We show that, when agents have matroidal valuations, there is a truthful allocation mechanism that achieves envy-freeness and utilitarian optimality by subsidizing each agent with at most 1, the maximum marginal contribution of each item for each agent. The design of the mechanism rests crucially on the underlying matroidal M-convexity of the Lorenz dominating allocations.
AB - The notion of envy-freeness is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are not guaranteed to exist. Classical works have avoided this issue by introducing an additional divisible resource, i.e., money. In this paper, we aim to design a truthful allocation mechanism of indivisible goods to achieve fairness and efficiency criteria with a limited amount of subsidy. Following the work of Halpern and Shah, our central question is as follows: to what extent do we need to rely on the power of money to accomplish these objectives? We show that, when agents have matroidal valuations, there is a truthful allocation mechanism that achieves envy-freeness and utilitarian optimality by subsidizing each agent with at most 1, the maximum marginal contribution of each item for each agent. The design of the mechanism rests crucially on the underlying matroidal M-convexity of the Lorenz dominating allocations.
KW - Algorithmic game theory
KW - Envy-freeness
KW - Mechanism design with money
KW - Resource allocation
UR - http://www.scopus.com/inward/record.url?scp=85182884110&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85182884110&partnerID=8YFLogxK
U2 - 10.1016/j.geb.2023.12.006
DO - 10.1016/j.geb.2023.12.006
M3 - Article
AN - SCOPUS:85182884110
SN - 0899-8256
VL - 144
SP - 49
EP - 70
JO - Games and Economic Behavior
JF - Games and Economic Behavior
ER -