<p>In this paper, we conceptualize parking in urban areas as a matching problem. We begin by formulating street parking behavior as a strategic game and develop a matching framework for this scenario. We demonstrate that the set of Nash equilibria in the parking game directly corresponds to the set of stable outcomes in the associated matching problem. Subsequently, we propose a centralized mechanism designed to allocate available parking spaces to drivers in a stable manner, facilitated through a digital platform, such as a mobile application. This mechanism can accommodate various practical needs by establishing a priority structure that may include distance priority, price priority, or resident priority.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Digital parking assignment: matching mechanism design approach

  • Jinyong Jeong

摘要

In this paper, we conceptualize parking in urban areas as a matching problem. We begin by formulating street parking behavior as a strategic game and develop a matching framework for this scenario. We demonstrate that the set of Nash equilibria in the parking game directly corresponds to the set of stable outcomes in the associated matching problem. Subsequently, we propose a centralized mechanism designed to allocate available parking spaces to drivers in a stable manner, facilitated through a digital platform, such as a mobile application. This mechanism can accommodate various practical needs by establishing a priority structure that may include distance priority, price priority, or resident priority.