The travel costs of the players (travelers) in anonymous congestion games depend on their choices of routes and also on the states of the transportation network such as incidents, weather, and road work. In this extended abstract, we consider an incomplete-information environment in which the realizations of the states are unobserved by the travelers. We study how a planner can incentivize the travelers to behave in her favor by strategically designing what and how the travelers get informed about the realizations of the states
Competition underlies much of the complexity of modern transportation systems and accurately modelin...
International audienceWe consider a repeated congestion game with imperfect monitoring. At each stag...
Most algorithmic studies on multi-agent information design so far have focused on the restricted sit...
Thesis: S.M., Massachusetts Institute of Technology, School of Engineering, Center for Computational...
We study a routing game in an environment with multiple heterogeneous information systems and an unc...
We consider anonymous Bayesian cost games with a large number of players, i.e., games where each pla...
Today's data-rich platforms are reshaping the operations of urban transportation networks by providi...
Congestion games have many important applications to systems where only limited knowledge may be ava...
Thesis: S.M., Massachusetts Institute of Technology, Computation for Design and Optimization Program...
Abstract. Wardrop equilibria are commonly used as a solution concept of network games when modeling ...
We design and estimate a game theoretic congestion pricing mechanism in which the regulator aims at ...
In congestion games, users make myopic routing decisions to jam each other, and the social planner w...
Global communication networks like the Internet often lack a central authority that monitors and reg...
We study the influence of information design on routing in the presence of vagaries, following the c...
AbstractIn this paper, we consider a traffic game where many atomic agents try to optimize their uti...
Competition underlies much of the complexity of modern transportation systems and accurately modelin...
International audienceWe consider a repeated congestion game with imperfect monitoring. At each stag...
Most algorithmic studies on multi-agent information design so far have focused on the restricted sit...
Thesis: S.M., Massachusetts Institute of Technology, School of Engineering, Center for Computational...
We study a routing game in an environment with multiple heterogeneous information systems and an unc...
We consider anonymous Bayesian cost games with a large number of players, i.e., games where each pla...
Today's data-rich platforms are reshaping the operations of urban transportation networks by providi...
Congestion games have many important applications to systems where only limited knowledge may be ava...
Thesis: S.M., Massachusetts Institute of Technology, Computation for Design and Optimization Program...
Abstract. Wardrop equilibria are commonly used as a solution concept of network games when modeling ...
We design and estimate a game theoretic congestion pricing mechanism in which the regulator aims at ...
In congestion games, users make myopic routing decisions to jam each other, and the social planner w...
Global communication networks like the Internet often lack a central authority that monitors and reg...
We study the influence of information design on routing in the presence of vagaries, following the c...
AbstractIn this paper, we consider a traffic game where many atomic agents try to optimize their uti...
Competition underlies much of the complexity of modern transportation systems and accurately modelin...
International audienceWe consider a repeated congestion game with imperfect monitoring. At each stag...
Most algorithmic studies on multi-agent information design so far have focused on the restricted sit...