Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Chandramouleeswaran, Harish"'
We study the classic problem of fairly dividing a set of indivisible items among a set of agents and consider the popular fairness notion of envy-freeness up to one item (EF1). While in reality, the set of agents and items may vary, previous works ha
Externí odkaz:
http://arxiv.org/abs/2410.14421
