Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.08448 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915250713919488 |
|---|---|
| author | Chen, Xujin Hu, Xiaodong Jing, Xinqi Tang, Zhongzheng |
| author_facet | Chen, Xujin Hu, Xiaodong Jing, Xinqi Tang, Zhongzheng |
| contents | The Informational Braess' Paradox (IBP) illustrates a counterintuitive scenario where revelation of additional roadway segments to some self-interested travelers leads to increased travel times for these individuals. IBP extends the original Braess' paradox by relaxing the assumption that all travelers have identical and complete information about the network. In this paper, we study the conditions under which IBP does not occur in networks with non-atomic selfish travelers and multiple origin-destination pairs. Our results completely characterize the network topologies immune to IBP, thus resolving an open question proposed by Acemoglu et al. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_08448 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | When does additional information lead to longer travel time in multi-origin-destination networks? Chen, Xujin Hu, Xiaodong Jing, Xinqi Tang, Zhongzheng Computer Science and Game Theory The Informational Braess' Paradox (IBP) illustrates a counterintuitive scenario where revelation of additional roadway segments to some self-interested travelers leads to increased travel times for these individuals. IBP extends the original Braess' paradox by relaxing the assumption that all travelers have identical and complete information about the network. In this paper, we study the conditions under which IBP does not occur in networks with non-atomic selfish travelers and multiple origin-destination pairs. Our results completely characterize the network topologies immune to IBP, thus resolving an open question proposed by Acemoglu et al. |
| title | When does additional information lead to longer travel time in multi-origin-destination networks? |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2410.08448 |