When an envy-free allocation of indivisible goods does not exist, monetary transfers can restore envy-freeness. Existing work on fair division with subsidies, however, typically assumes that these payments are provided by an external source, an assumption that may be unrealistic in many applications. We address this li...
Robert Bredereck, E. Deltl, Tanmay Inamdar et al.· 0 citations
This work studies the complexity of several variants of bus routing, focusing on how the objective function and the models for agents'walking costs influence the problem complexity, and finds that allowing agent-specific cost models leads to hardness even on extremely limited trees such as stars.
E. Deltl, Christian Komusiewicz, Jurek Rostalsky et al.· 0 citations
It is shown that this lower bound is tight and that a clustering in the $2$-Droop core always exists, and that such a clustering can be achieved by only selecting centers from locations in the metric space where an agent resides.
Benjamin Cookson, E. Deltl, Y. Oh· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.