6 citations · 6 across the 1 of their papers we have counts for
2 papers
cs.DM2024
Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
Nina Chiarelli, Clément Dallard, Andreas Darmann +4
We consider the task of allocating indivisible items to agents, when the agents' preferences over the items are identical. The preferences are captured by means of a directed acycl…
math.CO2017★ 6 cited
Tetris Hypergraphs and Combinations of Impartial Games
Endre Boros, Vladimir Gurvich, Nhan Bao Ho +2
The Sprague-Grundy (SG) theory reduces the sum of impartial games to the classical game of . We generalize the concept of sum and introduce $\cH$-combinations of impartial gam…