6 citations · 13 across the 8 of their papers we have counts for
4 papers · 1 filter
Tight Approximations for Graphical House Allocation
Hadi Hosseini, Andrew McGregor, Rik Sengupta +2
The Graphical House Allocation problem asks: how can houses (each with a fixed non-negative value) be assigned to the vertices of an undirected graph , so as to minimize the…
Time Fairness in Online Knapsack Problems
Adam Lechowicz, Rik Sengupta, Bo Sun +2
The online knapsack problem is a classic problem in the field of online algorithms. Its canonical version asks how to pack items of different values and weights arriving online int…
Multi-Structural Games and Beyond
Marco Carmosino, Ronald Fagin, Neil Immerman +3
Multi-structural (MS) games are combinatorial games that capture the number of quantifiers of first-order sentences. On the face of their definition, MS games differ from Ehrenfeuc…
Graphical House Allocation
Hadi Hosseini, Justin Payan, Rik Sengupta +2
The classical house allocation problem involves assigning houses (or items) to agents according to their preferences. A key criterion in such problems is satisfying some fa…