IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v117y2018ipbp723-739.html
   My bibliography  Save this article

A car sharing auction with temporal-spatial OD connection conditions

Author

Listed:
  • Hara, Yusuke
  • Hato, Eiji

Abstract

In this study, a tradable permit mechanism for a car sharing system was proposed. Car sharing services that allow users to move freely decrease the efficiency of sharing vehicle use due to the uneven distribution of vehicles and origin-destination (OD) demands. Thus, a tradable permit mechanism and a solution algorithm were proposed to solve this problem in this study. First, the Vickrey–Clarke–Groves mechanism for car sharing was proposed. This mechanism allowed the tradable permit system to achieve both strategy-proofness and efficient allocation. The difference between the case of single-minded bidders and that of multiple bidders was subsequently discussed. A single-minded bidder is defined as an agent that only bids on one item and a multiple bidder is defined as an agent that bids on more than one item. The results indicated that the permit price was decomposed into the usage fee for leaving the origin sharing station and the income for arriving at the destination sharing station. Additionally, the findings indicated that the negative price of using mobility sharing could occur when there was high asymmetric imbalanced OD demand. The negative price (that is benefit) could encourage the natural relocation of vehicles under the auction mechanism. The framework was then extended to treating a round trip case. Finally, a solution algorithm for these problems was proposed, and numerical examples were presented. The results demonstrated that the problem setting and the solution algorithm were feasible from the computational time viewpoint.

Suggested Citation

  • Hara, Yusuke & Hato, Eiji, 2018. "A car sharing auction with temporal-spatial OD connection conditions," Transportation Research Part B: Methodological, Elsevier, vol. 117(PB), pages 723-739.
    • Handle: RePEc:eee:transb:v:117:y:2018:i:pb:p:723-739
    DOI: 10.1016/j.trb.2017.08.025
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517306860
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2017.08.025?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Christine Fricker & Nicolas Gast, 2016. "Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 261-291, August.
    2. Nie, Yu (Marco) & Yin, Yafeng, 2013. "Managing rush hour travel choices with tradable credit scheme," Transportation Research Part B: Methodological, Elsevier, vol. 50(C), pages 1-19.
    3. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    4. Viegas, José M., 2001. "Making urban road pricing acceptable and effective: searching for quality and equity in urban mobility," Transport Policy, Elsevier, vol. 8(4), pages 289-294, October.
    5. Vijay Krishna & Motty Perry, 1997. "Efficient Mechanism Design," Game Theory and Information 9703010, University Library of Munich, Germany, revised 28 Apr 1998.
    6. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    7. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    8. Jorge, Diana & Molnar, Goran & de Almeida Correia, Gonçalo Homem, 2015. "Trip pricing of one-way station-based carsharing networks with zone and time of day price variations," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 461-482.
    9. Yang, Hai & Liu, Wei & Wang, Xiaolei & Zhang, Xiaoning, 2013. "On the morning commute problem with bottleneck congestion and parking space constraints," Transportation Research Part B: Methodological, Elsevier, vol. 58(C), pages 106-118.
    10. Bikhchandani, Sushil & Ostroy, Joseph M., 2002. "The Package Assignment Model," Journal of Economic Theory, Elsevier, vol. 107(2), pages 377-406, December.
    11. E Verhoef & P Nijkamp & P Rietveld, 1997. "Tradeable Permits: Their Potential in the Regulation of Road Transport Externalities," Environment and Planning B, , vol. 24(4), pages 527-548, August.
    12. Ariel Waserhole & Vincent Jost, 2016. "Pricing in vehicle sharing systems: optimization in queuing networks with product forms," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 293-320, August.
    13. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong & Yang, Hai, 2012. "Design of more equitable congestion pricing and tradable credit schemes for multimodal transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1273-1287.
    14. Wong, Jinn-Tsai, 1997. "Basic concepts for a system for advance booking for highway use," Transport Policy, Elsevier, vol. 4(2), pages 109-114, April.
    15. Yang, Hai & Wang, Xiaolei, 2011. "Managing network mobility with tradable credits," Transportation Research Part B: Methodological, Elsevier, vol. 45(3), pages 580-594, March.
    16. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    17. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Qingyang Xiao & Jee Eun Kang, 2023. "Pricing in emerging mobility services: a comprehensive review," Journal of Revenue and Pricing Management, Palgrave Macmillan, vol. 22(6), pages 482-500, December.
    2. Hara, Yusuke, 2018. "Behavioral mechanism design for transportation services: Laboratory experiments and preference elicitation cost," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 231-245.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yusuke Hara & Eiji Hato, 2019. "Analysis of dynamic decision-making in a bicycle-sharing auction using a dynamic discrete choice model," Transportation, Springer, vol. 46(1), pages 147-173, February.
    2. Hara, Yusuke, 2018. "Behavioral mechanism design for transportation services: Laboratory experiments and preference elicitation cost," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 231-245.
    3. Wada, Kentaro & Akamatsu, Takashi, 2013. "A hybrid implementation mechanism of tradable network permits system which obviates path enumeration: An auction mechanism with day-to-day capacity control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 60(C), pages 94-112.
    4. Wang, Pengfei & Guan, Hongzhi & Liu, Peng, 2020. "Modeling and solving the optimal allocation-pricing of public parking resources problem in urban-scale network," Transportation Research Part B: Methodological, Elsevier, vol. 137(C), pages 74-98.
    5. Gao, Ge & Sun, Huijun & Wu, Jianjun & Liu, Xinmin & Chen, Weiya, 2018. "Park-and-ride service design under a price-based tradable credits scheme in a linear monocentric city," Transport Policy, Elsevier, vol. 68(C), pages 1-12.
    6. Dao-Li Zhu & Hai Yang & Chang-Min Li & Xiao-Lei Wang, 2015. "Properties of the Multiclass Traffic Network Equilibria Under a Tradable Credit Scheme," Transportation Science, INFORMS, vol. 49(3), pages 519-534, August.
    7. Ren-Yong Guo & Hai-Jun Huang & Hai Yang, 2019. "Tradable Credit Scheme for Control of Evolutionary Traffic Flows to System Optimum: Model and its Convergence," Networks and Spatial Economics, Springer, vol. 19(3), pages 833-868, September.
    8. Ye, Hongbo & Yang, Hai, 2013. "Continuous price and flow dynamics of tradable mobility credits," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 436-450.
    9. Ren-Yong Guo & Hai Yang & Hai-Jun Huang & Zhijia Tan, 2016. "Day-to-Day Flow Dynamics and Congestion Control," Transportation Science, INFORMS, vol. 50(3), pages 982-997, August.
    10. He, Fang & Yin, Yafeng & Shirmohammadi, Nima & Nie, Yu (Marco), 2013. "Tradable credit schemes on networks with mixed equilibrium behaviors," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 47-65.
    11. Mishra, Debasis & Parkes, David C., 2007. "Ascending price Vickrey auctions for general valuations," Journal of Economic Theory, Elsevier, vol. 132(1), pages 335-366, January.
    12. Lawrence M. Ausubel, 2006. "An Efficient Dynamic Auction for Heterogeneous Commodities," American Economic Review, American Economic Association, vol. 96(3), pages 602-629, June.
    13. Bao, Yue & Verhoef, Erik T. & Koster, Paul, 2019. "Regulating dynamic congestion externalities with tradable credit schemes: Does a unique equilibrium exist?," Transportation Research Part B: Methodological, Elsevier, vol. 127(C), pages 225-236.
    14. M. Yenmez, 2015. "Incentive compatible market design with applications," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 543-569, August.
    15. Tomoya Kazumura & Shigehiro Serizawa, 2016. "Efficiency and strategy-proofness in object assignment problems with multi-demand preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 633-663, October.
    16. Fan, Wenbo & Jiang, Xinguo, 2013. "Tradable mobility permits in roadway capacity allocation: Review and appraisal," Transport Policy, Elsevier, vol. 30(C), pages 132-142.
    17. Siyu Chen & Ravi Seshadri & Carlos Lima Azevedo & Arun P. Akkinepally & Renming Liu & Andrea Araldo & Yu Jiang & Moshe E. Ben-Akiva, 2021. "Market Design for Tradable Mobility Credits," Papers 2101.00669, arXiv.org, revised Sep 2022.
    18. Bao, Yue & Xiao, Feng & Gao, Zaihan & Gao, Ziyou, 2017. "Investigation of the traffic congestion during public holiday and the impact of the toll-exemption policy," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 58-81.
    19. Andersson, Tommy & Erlanson, Albin, 2013. "Multi-item Vickrey–English–Dutch auctions," Games and Economic Behavior, Elsevier, vol. 81(C), pages 116-129.
    20. Zhang, Fang & Lu, Jian & Hu, Xiaojian, 2021. "Tradable credit scheme design with transaction cost and equity constraint," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 145(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:117:y:2018:i:pb:p:723-739. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.