This paper considers Bayesian persuasion for routing games where information about the uncertain state of the network is provided by a traffic information system (TIS) using public signals. In this setup, the TIS commits to a signalling scheme and participants form a posterior belief about the state of the network based on prior beliefs and received signal. They subsequently select routes minimizing their individual expected travel time under their posterior beliefs, giving rise to a Wardrop equilibrium. We investigate how the TIS can infer the prior beliefs held by the participants by designing suitable signalling schemes, and observing the equilibrium flows under different signals. We show that under mild conditions a signalling scheme that allows for exact inference of the prior exists. We then provide an iterative algorithm that finds such a scheme in a finite number of steps. Finally, we show how in the simplified 2-road, 2-state case such a scheme can be constructed without the need for a sequential procedure. Several examples illustrate our results.
翻译:本文考虑了Bayesian在使用公共信号的交通信息系统(TIS)提供网络不确定状态信息的航线游戏的说服权。在这个设置中,TIS承诺采用信号计划,参与者根据先前的信念和收到的信号形成对网络状态的后置信念。他们随后选择了将个人预期旅行时间减少到其后置信念之下、导致战争倾斜平衡的路线。我们调查TIS如何通过设计适当的信号计划并观察不同信号下的平衡流量来推断参与者先前持有的信念。我们表明,在温和条件下,一个信号计划允许准确推断前置存在的情况。我们随后提供了一种迭代算法,在有限的步骤中发现这样一个计划。最后,我们展示了在简化的2条道路上如何在不需要连续程序的情况下构建这种计划。我们举了几个例子来说明我们的结果。