Allocation of Divisible Goods under Lexicographic Preferences
Computer Science and Game Theory
2017-02-17 v4 Data Structures and Algorithms
Abstract
We present a simple and natural non-pricing mechanism for allocating divisible goods among strategic agents having lexicographic preferences. Our mechanism has favorable properties of incentive compatibility (strategy-proofness), Pareto efficiency, envy-freeness, and time efficiency.
Keywords
Cite
@article{arxiv.1206.4366,
title = {Allocation of Divisible Goods under Lexicographic Preferences},
author = {Leonard J. Schulman and Vijay V. Vazirani},
journal= {arXiv preprint arXiv:1206.4366},
year = {2017}
}