Incentives in Ridesharing with De fi cit Control

This paper proposes a novel market-based system for ridesharing, where commuters are matched based on their declared travel constraints, the number of available seats (which could be zero), and their costs. Based on this information, the system then designates commuters to be either drivers or riders, finds appropriate matches, and calculates rewards for drivers and payments for riders. We show that, for this system, the well-known Vickrey-Clarke-Groves (VCG) mechanism is incentive compatible (IC), individually rational (IR) and efficient (i.e., minimizing cost), but results in a very high deficit, thus requiring large subsidies. We therefore investigate alternative mechanisms. We first consider mechanisms with fixed prices and show that no such mechanism can be both efficient and IC. Thus, we propose an inefficient IC mechanism but which has deficit control. We then consider a VCG mechanism with two-sided reserve prices. We show that this mechanism is IC and IR for a certain range of reserve prices, and we analyse the deficit bounds and how these can be controlled. We furthermore show that the deficit can be controlled even further by limiting the (costly) detours taken by the drivers when computing the allocations, thereby trading off efficiency and deficit.

[1]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[2]  N. Nisan Introduction to Mechanism Design (for Computer Scientists) , 2007 .

[3]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[4]  Y. Narahari,et al.  Game Theoretic Problems in Network Economics and Mechanism Design Solutions , 2009, Advanced Information and Knowledge Processing.

[5]  R. McAfee,et al.  A dominant strategy double auction , 1992 .

[6]  M. Satterthwaite,et al.  Efficient Mechanisms for Bilateral Trading , 1983 .

[7]  Douglas M. King,et al.  Fuel saving and ridesharing in the US: Motivations, limitations, and opportunities , 2009 .

[8]  Eric Horvitz,et al.  Collaboration and shared plans in the open world: studies of ridesharing , 2009, IJCAI 2009.

[9]  David C. Parkes,et al.  Achieving Budget-Balance with Vickrey-Based Payment Schemes in Exchanges , 2001, IJCAI.

[10]  Quang Vuong,et al.  First-Price Sealed-Bid Auctions with Secret Reservation Prices , 1994 .

[11]  Ali Hortaçsu,et al.  Winner's Curse, Reserve Prices and Endogenous Entry: Empirical Insights from Ebay Auctions , 2003 .

[12]  Rica Gonen,et al.  Generalized trade reduction mechanisms , 2007, EC '07.

[13]  Bernhard Nebel,et al.  A Mechanism for Dynamic Ride Sharing Based on Parallel Auctions , 2011, IJCAI.

[14]  R. Novaco,et al.  Commuting Stress, Ridesharing, and Gender: Analyses from the 1993 State of the Commute Study in Southern California , 1994 .

[15]  Susan Shaheen,et al.  Ridesharing in North America: Past, Present, and Future , 2012 .