信息如何影响非对称拥塞博弈？
How does information affect asymmetric congestion games?
摘要：
我们研究具有多个起点-目的地对的交通网络，放松了代理完全了解网络结构的简化假设。我们确定了一个无处不在的网络类，即，环，我们可以安全地增加代理的知识，而不会影响他们自己的整体性能-称为免疫信息Braess'Parabolism-关闭文献中的空白。我们还扩展了我们的性能指标，包括所有代理的福利，表明在此措施下IBP是一个普遍的现象，没有网络是免疫的。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
