Cited By
View all- Benabbou NChakraborty MIgarashi AZick Y(2021)Finding Fair and Efficient Allocations for Matroid Rank ValuationsACM Transactions on Economics and Computation10.1145/34850069:4(1-41)Online publication date: 16-Oct-2021
We revisit the classic problem of fair division from a mechanism design perspective and provide an elegant truthful mechanism that yields surprisingly good approximation guarantees for the widely used solution of Proportional Fairness. This solution, ...
We address the problem of fair division, or cake cutting, with the goal of finding truthful mechanisms. In the case of a general measure space ("cake") and non-atomic, additive individual preference measures - or utilities - we show that there exists a ...
We study the classic setting of envy-free pricing, in which a single seller chooses prices for its many items, with the goal of maximizing revenue once the items are allocated. Despite the large body of work addressing such settings, most versions of ...
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in