Envy-Free Division of Sellable Goods

Authors

  • Jeremy Karp Carnegie Mellon University
  • Aleksandr Kazachkov Carnegie Mellon University
  • Ariel Procaccia Carnegie Mellon University

DOI:

https://doi.org/10.1609/aaai.v28i1.8815

Keywords:

Computational social choice, Fair division, Envy-free allocation

Abstract

We study the envy-free allocation of indivisible goods between two players. Our novel setting includes an option to sell each good for a fraction of the minimum value any player has for the good. To rigorously quantify the efficiency gain from selling, we reason about the price of envy-freeness of allocations of sellable goods — the ratio between the maximum social welfare and the social welfare of the best envy-free allocation. We show that envy-free allocations of sellable goods are significantly more efficient than their unsellable counterparts.

Downloads

Published

2014-06-21

How to Cite

Karp, J., Kazachkov, A., & Procaccia, A. (2014). Envy-Free Division of Sellable Goods. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1). https://doi.org/10.1609/aaai.v28i1.8815

Issue

Section

AAAI Technical Track: Game Theory and Economic Paradigms