# Mechanism Design for Fair Allocation

arXiv: https://arxiv.org/abs/1504.05670 · HTML: https://mlsanity.com/paper/1504.05670/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 22 Apr 2015.

## Built on by (most cited first, 2 of 2)

- [Roadmap on Incentive Compatibility for AI Alignment and Governance in Sociotechnical Systems](https://mlsanity.com/paper/2402.12907/) (2024)
- [Fair Allocation in Dynamic Mechanism Design](https://mlsanity.com/paper/2406.00147/) (2024)

## Abstract (arXiv)

Mechanism design for a social utility being the sum of agents' utilities (SoU) is a well-studied problem. There are, however, a number of problems of theoretical and practical interest where a designer may have a different objective than maximization of the SoU. One motivation for this is the desire for more equitable allocation of resources among agents. A second, more subtle, motivation is the fact that a fairer allocation indirectly implies less variation in taxes which can be desirable in a situation where (implicit) individual agent budgetary constraints make payment of large taxes unrealistic. In this paper we study a family of social utilities that provide fair allocation (with SoU being subsumed as an extreme case) and derive conditions under which Bayesian and Dominant strategy implementation is possible. Furthermore, it is shown how a simple modification of the above mechanism can guarantee full Bayesian implementation. Through a numerical example it is shown that the proposed method can result in significant gains both in allocation fairness and tax reduction.
