1 citations · 2 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Hardness of Interval Scheduling on Unrelated Machines
Danny Hermelin, Yuval Itzhaki, Hendrik Molter +1
We provide new (parameterized) computational hardness results for Interval Scheduling on Unrelated Machines. It is a classical scheduling problem motivated from just-in-time or lea…
cs.CC2010★ 1 cited
Parameterized Two-Player Nash Equilibrium
Danny Hermelin, Chien-Chung Huang, Stefan Kratsch +1
We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of varian…