Truthfulness, Proportional Fairness, and Efficiency
Richard Cole, Vasilis Gkatzelis, Gagan Goel

TL;DR
This paper explores fair and efficient resource allocation among strategic agents without money, proposing truthful mechanisms that approximate proportional fairness and improve on existing efficiency bounds.
Contribution
It introduces new truthful mechanisms that approximate proportional fairness and surpass known efficiency bounds, including a non-swap-dictatorial mechanism for two agents.
Findings
Proposed mechanisms achieve better fairness approximations as minimum demand increases.
Surpassed the 0.5 lower bound on social welfare approximation for two agents.
Developed a non-swap-dictatorial mechanism improving efficiency bounds.
Abstract
How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory outcomes. This paper studies this question, looking at both fairness and efficiency measures. We employ the proportionally fair solution, which is a well-known fairness concept for money-free settings. But although finding a proportionally fair solution is computationally tractable, it cannot be implemented in a truthful fashion. Consequently, we seek approximate solutions. We give several truthful mechanisms which achieve proportional fairness in an approximate sense. We use a strong notion of approximation, requiring the mechanism to give each agent a good approximation of its proportionally fair utility. In particular, one of our mechanisms provides a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Game Theory and Voting Systems · Economic theories and models
