arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1601.04041cs.CRmath.OC
收藏

路由博弈中种群的差分隐私

Differential Privacy of Populations in Routing Games

Roy Dong, Walid Krichene, Alexandre M. Bayen, S. Shankar Sastry

摘要:

随着地面交通基础设施的现代化,大量的数据被测量、传输和存储,促使人们对这些新兴的网络物理技术的隐私方面进行分析。在本文中,我们考虑隐私的路由游戏,司机的起源和目的地被认为是私人的。这是出于这样一个事实,即这种时空信息可以很容易地被用作一个人的活动的推断的基础。更具体地说,我们考虑的差分隐私的映射流量为每个源-目的地对交通网络的每个链路上的流量测量。我们使用一个随机在线学习框架的人口动态,这是已知的路由游戏的纳什均衡收敛。我们分析了这个过程的敏感性,并为这些模型的收敛速度以及差分隐私值提供了理论保证。我们证实了这些模拟一个小的例子。

英文摘要:

As our ground transportation infrastructure modernizes, the large amount of data being measured, transmitted, and stored motivates an analysis of the privacy aspect of these emerging cyber-physical technologies. In this paper, we consider privacy in the routing game, where the origins and destinations of drivers are considered private. This is motivated by the fact that this spatiotemporal information can easily be used as the basis for inferences for a person's activities. More specifically, we consider the differential privacy of the mapping from the amount of flow for each origin-destination pair to the traffic flow measurements on each link of a traffic network. We use a stochastic online learning framework for the population dynamics, which is known to converge to the Nash equilibrium of the routing game. We analyze the sensitivity of this process and provide theoretical guarantees on the convergence rates as well as differential privacy values for these models. We confirm these with simulations on a small example.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑