How does information affect asymmetric congestion games?

We study traffic networks with multiple origin-destination pairs, relaxing the simplifying assumption of agents having complete knowledge of the network structure. We identify a ubiquitous class of networks, i.e., rings, for which we can safely increase the agents' knowledge without affecting their own overall performance -- known as immunity to Informational Braess' Paradox -- closing a gap in the literature. We also extend our performance measure to include the welfare of all agents, showing that under this measure IBP is a widespread phenomenon and no network is immune to it.