arXiv:2506.19176

Visibly Fair Mechanisms

Inácio Bó, Gian Caspari, Manshu Khanna

제출 2025-06-23

원문 초록

Priority-based allocation of individuals to positions are pervasive, and elimination of justified envy is often, an absolute requirement. This leaves serial dictatorship (SD) as the only rule that avoids justified envy under standard direct mechanisms. What if SD outcomes are undesirable from a designer's perspective? We propose visible fairness, which demands fairness relative to the (potentially purposefully incomplete) preference information the mechanism elicits. Visibly fair mechanisms generalize SD; we fully characterize them and provide necessary and sufficient conditions for strategy-proofness. We show how to apply these results to design strategy-proof visibly fair rules that satisfy a broad class of distributional objectives. Visible fairness, however, results in a new information-efficiency trade-off: meeting distributional goals leads to the avoidance of eliciation of information about preferences that could prevent inefficiencies.

함께 살펴볼 논문

공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.

토론

이 논문과 연결된 포럼 글이 아직 없습니다.