2018. Finding fair and efficient allocations. In Proceedings of the 19th ACM Conference on Economics and Computation (EC). 557-574.S. Barman, S. Kumar Krishna Murthy, and R. Vaish. Finding fair and efficient allocations. In Proceedings of the 19th ACM Conference on Economics and Computation ...
The really interesting thing about VAR, is that after its implementationthere is still a fair amount of dispute regarding key referee decisions. Even with the additional data provided by VAR, pundits are still arguing whether decisions on offsides, penalties and such where correct or not. ...
In this paper, we present new results on the fair and efficient allocation of indivisible goods to agents that have monotone, submodular, non-additive valuation functions over bundles. Despite their simple structure, these agent valuations are a natural model for several real-world domains. We ...
Dall'Aglio M, Di Luca C (2012) Finding maxmin allocations in cooperative and competi- tive fair division, URL http://arxiv.org/abs/1110.4241.pdf, arXiv preprint 1110.4241, 1110.4241.pdfDall'Aglio, M., Di Luca, C.: Finding maxmin allocations in cooperative and com- petitive fair ...
and Di Luca, C. (2014). Finding maxmin allocations in co- operative and competitive fair division. Annals of Operations Research, 223(1):121-136.Dall'Aglio M, Di Luca C (2012) Finding maxmin allocations in cooperative and competi- tive fair division, URL http://arxiv.org/abs/...
An efficient deployment needs to continuously determine the best allocation according to the actual service needs, while also taking relocation costs into account when such allocation must be modified. For large scale problems, centrally predicting optimal allocations and movement paths for each robot ...
The core of such a game contains all fair allocations of the value of among the players, and is well-known to be non-empty iff graph is stable. The stabilizer problem addresses the question of how to modify the graph to ensure that the core is non-empty. We show that this problem is...
The core of such a game contains all fair allocations of the value of among the players, and is well-known to be non-empty iff graph is stable. The stabilizer problem addresses the question of how to modify the graph to ensure that the core is non-empty. We show that this problem is...
The core of such a game contains all fair allocations of the value of V among the players, and is well-known to be non-empty iff graph G is stable. The stabilizer problem addresses the question of how to modify the graph to ensure that the core is non-empty. We show that this ...