Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Trabelsi, Yohai"'
In many settings, there is an organizer who would like to divide a set of agents into $k$ coalitions, and cares about the friendships within each coalition. Specifically, the organizer might want to maximize utilitarian social welfare, maximize egali
Externí odkaz:
http://arxiv.org/abs/2408.07368
Assigning tasks to service providers is a frequent procedure across various applications. Often the tasks arrive dynamically while the service providers remain static. Preventing task rejection caused by service provider overload is of utmost signifi
Externí odkaz:
http://arxiv.org/abs/2407.00032
Autor:
Adiga, Abhijin, Trabelsi, Yohai, Ferdousi, Tanvir, Marathe, Madhav, Ravi, S. S., Swarup, Samarth, Vullikanti, Anil Kumar, Wilson, Mandy L., Kraus, Sarit, Basu, Reetwika, Savalkar, Supriya, Yourek, Matthew, Brady, Michael, Rajagopalan, Kirti, Yoder, Jonathan
Optimal allocation of agricultural water in the event of droughts is an important global problem. In addressing this problem, many aspects, including the welfare of farmers, the economy, and the environment, must be considered. Under this backdrop, o
Externí odkaz:
http://arxiv.org/abs/2402.06576
Applications such as employees sharing office spaces over a workweek can be modeled as problems where agents are matched to resources over multiple rounds. Agents' requirements limit the set of compatible resources and the rounds in which they want t
Externí odkaz:
http://arxiv.org/abs/2211.17199
Many scenarios where agents with restrictions compete for resources can be cast as maximum matching problems on bipartite graphs. Our focus is on resource allocation problems where agents may have restrictions that make them incompatible with some re
Externí odkaz:
http://arxiv.org/abs/2209.05170
Let $P$ be a set of $2n$ points in the plane, and let $M_{\rm C}$ (resp., $M_{\rm NC}$) denote a bottleneck matching (resp., a bottleneck non-crossing matching) of $P$. We study the problem of computing $M_{\rm NC}$. We first prove that the problem i
Externí odkaz:
http://arxiv.org/abs/1202.4146
Publikováno v:
In Computational Geometry: Theory and Applications April 2014 47(3) Part A:447-457
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.