TRIPS体系结构
方案(数学)
补贴
点对点
激励
匹配(统计)
集合(抽象数据类型)
订单(交换)
私人信息检索
计算机科学
交通拥挤
修边
微观经济学
计算机安全
运输工程
经济
计算机网络
数学
工程类
市场经济
数学分析
操作系统
并行计算
统计
程序设计语言
财务
作者
Amirmahdi Tafreshian,Neda Masoud
标识
DOI:10.1016/j.trb.2022.05.010
摘要
Traffic congestion during peak periods has become a serious issue around the globe, partly due to the high number of single-occupancy commuter trips. Peer-to-peer (P2P) ridesharing platforms can present a suitable alternative for serving commuter trips. However, they face a major obstacle that prevents them from being a viable mode of transportation in practice: ridesharing users often provide tight time windows, which ultimately leads to a low matching rate. This study addresses this issue by introducing a subsidy scheme that allocates incentives to encourage a few carefully selected set of travelers to change their desired departure or arrival times, and thereby form successful matches. In order to implement this scheme for a ridesharing platform in the existence of private information, we propose an auction-based mechanism that guarantees truthfulness, individual rationality, budget-balance, and computational efficiency. Using numerical experiments, we show the merits of the proposed subsidy scheme when compared to its no-deficit variant as well as the conventional VCG mechanism.
科研通智能强力驱动
Strongly Powered by AbleSci AI