43 citations · 137 across the 7 of their papers we have counts for
3 papers · 1 filter
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…
Explainable Clustering via Exemplars: Complexity and Efficient Approximation Algorithms
Ian Davidson, Michael Livanos, Antoine Gourru +3
Explainable AI (XAI) is an important developing area but remains relatively understudied for clustering. We propose an explainable-by-design clustering approach that not only finds…
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…