23 citations · 38 across the 27 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2022★ 1 cited
Resource Sharing Through Multi-Round Matchings
Yohai Trabelsi, Abhijin Adiga, Sarit Kraus +2
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 lim…
cs.AI2022★ 1 cited
Resource Allocation to Agents with Restrictions: Maximizing Likelihood with Minimum Compromise
Yohai Trabelsi, Abhijin Adiga, Sarit Kraus +1
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…