2 papers across 1 session
We contribute polynomial-time algorithms to determine competitive assignments for agents with congestion aversed preferences