We contribute polynomial-time algorithms to determine competitive assignments for agents with congestion aversed preferences

We provide computationally efficient payoff-based learning algorithms which significantly improve upon prior work in terms of runtime for learning CCE