• Evaluation of the Iwata–Yokoi Algorithm 

      Hummel, Halvard (Master thesis, 2020)
      Gitt en urettet multigraf, G = (V, E), uten løkker, og en delmengde terminaler, T ⊆ V, kalles en sti mellom to distinkte terminaler, hvor alle interne noder i stien ikke er terminaler, en T-sti. Gitt denne definisjonen ...
    • Fair allocation of conflicting items 

      Hummel, Halvard; Hetland, Magnus Lie (Peer reviewed; Journal article, 2021)
      We study fair allocation of indivisible items, where the items are furnished with a set of conflicts, and agents are not permitted to receive conflicting items. This kind of constraint captures, for example, participating ...
    • Fairest Neighbors: Tradeoffs Between Metric Queries 

      Hetland, Magnus Lie; Hummel, Halvard (Chapter, 2021)
      Metric search commonly involves finding objects similar to a given sample object. We explore a generalization, where the desired result is a fair tradeoff between multiple query objects. This builds on previous results on ...