Strategy-proofness, Envy-freeness and Pareto efficiency in Online Fair Division with Additive Utilities

29 Jun 2020 Aleksandrov Martin Walsh Toby

We consider fair division problems where indivisible items arrive one-by-one in an online fashion and are allocated immediately to agents who have additive utilities over these items. Many existing offline mechanisms do not work in this online setting... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTER SCIENCE AND GAME THEORY

Datasets


  Add Datasets introduced or used in this paper