Effect of information in Bayesian congestion games

This thesis studies routing in a general single o-d network and information structure induced by any two heterogeneous information systems. To model the asymmetric information environment, we formulate a Bayesian congestion game, where travelers subscribing to one information system is seen as one population. We study properties of Bayesian Wardrop Equilibrium, where each population assigns their demand to routes with the lowest expected cost based on their belief. We show that if population beliefs about the state and the signal received by the other population are based on a common prior, as the population sizes change, qualitative properties of equilibrium strategies change, resulting in three distinct regimes. In the intermediate regime, the equilibrium edge load does not vary with the relative population size, and both populations face identical cost in equilibrium. In the other two regimes, the "minor" population has lower cost in equilibrium. We also introduce a metric to evaluate the impact of information. The relative population size effects the equilibrium outcome (edge load, costs) if and only if the impact of information on either population is tightly bounded by its size. Finally, we compute the bounds on the equilibrium social cost, and provide a sufficient condition for the bounds to be tight. Although we consider a more general information environment, the worst case inefficiency of equilibrium is the same as that in complete information games..

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Civil and Environmental Engineering.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2017

Author dc:creator

• Wu, Manxi

Advisor dc:contributor.advisor

• Saurabh Amin.

• Civil and Environmental Engineering.

Statement dc:rights

• MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/111425

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/111425