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

Shared parking problem: A novel truthful double auction mechanism approach

Author

Listed:
  • Xiao, Haohan
  • Xu, Meng
  • Gao, Ziyou

Abstract

Considering a parking platform with multiple slot demanders and multiple slot suppliers, this paper addresses two truthful double auction mechanisms for shared parking problem, where the demanders targeted by the proposed mechanisms are with flexible schedules and for non-work activities, and the suppliers are with the typical daily ‘driving go out early and come back at dusk’ pattern. To provide flexible match schemes and increase the trading scale, we allow “all-or-nothing” principle for demanders and “one-to-many” principle for suppliers. Based on the parking slot allocation rule and the transaction payment rule, we first relax the single output restriction (suppliers can only submit bids on a single unit of one commodity) and propose a “demander competition padding method (DC-PM)” auction mechanism, which is used to solve potential budget deficit. To avoid the likely distorted social welfare resulted by the DC-PM auction mechanism and to add budget surplus, we further modify the parking slot allocation rule and the transaction payment rule in the DC-PM auction mechanism, and propose a “modified demander competition padding method (MDC-PM)” auction mechanism. Three economical properties of both auction mechanisms, i.e. incentive compatibility, individual rationality and budget balance, are proved. Numerical experiments show that the proposed two auction mechanisms can realize asymptotic efficiency as both demanders and suppliers approach infinity. Moreover, the DC-PM auction mechanism is superior to the MDC-PM auction mechanism with respect to participants’ utilities and can maintain the strict lexicographic allocation order, and the MDC-PM auction mechanism outperforms the DC-PM auction mechanism in terms of welfare efficiency and platform's payoff. Issues of managerial implications for shared parking problem are further discussed in this paper.

Suggested Citation

  • Xiao, Haohan & Xu, Meng & Gao, Ziyou, 2018. "Shared parking problem: A novel truthful double auction mechanism approach," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 40-69.
    • Handle: RePEc:eee:transb:v:109:y:2018:i:c:p:40-69
    DOI: 10.1016/j.trb.2018.01.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517306550
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2018.01.008?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. Myerson, Roger B, 1983. "Mechanism Design by an Informed Principal," Econometrica, Econometric Society, vol. 51(6), pages 1767-1797, November.
    2. Shoup, Donald C., 2006. "Cruising for parking," Transport Policy, Elsevier, vol. 13(6), pages 479-486, November.
    3. Leon Yang Chu, 2009. "Truthful Bundle/Multiunit Double Auctions," Management Science, INFORMS, vol. 55(7), pages 1184-1198, July.
    4. Kaspi, Mor & Raviv, Tal & Tzur, Michal & Galili, Hila, 2016. "Regulating vehicle sharing systems through parking reservation policies: Analysis and performance bounds," European Journal of Operational Research, Elsevier, vol. 251(3), pages 969-987.
    5. Dilip Mookherjee, 2008. "The 2007 Nobel Memorial Prize in Mechanism Design Theory," Scandinavian Journal of Economics, Wiley Blackwell, vol. 110(2), pages 237-260, June.
    6. Hurwicz, Leonid, 1973. "The Design of Mechanisms for Resource Allocation," American Economic Review, American Economic Association, vol. 63(2), pages 1-30, May.
    7. Chu, Leon Yang & Shen, Zuo-Jun Max, 2007. "Trade reduction vs. multi-stage: A comparison of double auction design approaches," European Journal of Operational Research, Elsevier, vol. 180(2), pages 677-691, July.
    8. van Ommeren, Jos & Wentink, Derk & Dekkers, Jasper, 2011. "The real price of parking policy," Journal of Urban Economics, Elsevier, vol. 70(1), pages 25-31, July.
    9. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    10. Cheng, Meng & Xu, Su Xiu & Huang, George Q., 2016. "Truthful multi-unit multi-attribute double auctions for perishable supply chain trading," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 21-37.
    11. Chen, Xiaojie & Zhao, Jinhua, 2013. "Bidding to drive: Car license auction policy in Shanghai and its public acceptance," Transport Policy, Elsevier, vol. 27(C), pages 39-52.
    12. Shoup, Donald C., 2006. "Cruising for Parking," University of California Transportation Center, Working Papers qt55s7079f, University of California Transportation Center.
    13. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    14. Mark A. Satterthwaite & Steven R. Williams, 1989. "The Rate of Convergence to Efficiency in the Buyer's Bid Double Auction as the Market Becomes Large," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 56(4), pages 477-498.
    15. Zou, Bo & Kafle, Nabin & Wolfson, Ouri & Lin, Jie (Jane), 2015. "A mechanism design based approach to solving parking slot assignment in the information era," Transportation Research Part B: Methodological, Elsevier, vol. 81(P2), pages 631-653.
    16. Xu, Su Xiu & Cheng, Meng & Kong, Xiang T.R. & Yang, Hai & Huang, George Q., 2016. "Private parking slot sharing," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 596-617.
    17. Babaioff, Moshe & Nisan, Noam & Pavlov, Elan, 2009. "Mechanisms for a spatially distributed market," Games and Economic Behavior, Elsevier, vol. 66(2), pages 660-684, July.
    18. McAfee, R. Preston, 1992. "A dominant strategy double auction," Journal of Economic Theory, Elsevier, vol. 56(2), pages 434-450, April.
    19. Leon Yang Chu & Zuo-Jun Max Shen, 2008. "Truthful Double Auction Mechanisms," Operations Research, INFORMS, vol. 56(1), pages 102-120, February.
    20. Kuyzu, Gültekin & Akyol, Çağla Gül & Ergun, Özlem & Savelsbergh, Martin, 2015. "Bid price optimization for truckload carriers in simultaneous transportation procurement auctions," Transportation Research Part B: Methodological, Elsevier, vol. 73(C), pages 34-58.
    21. Hu, Lu & Liu, Yang, 2016. "Joint design of parking capacities and fleet size for one-way station-based carsharing systems with road congestion constraints," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 268-299.
    22. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    23. Xu, Su Xiu & Huang, George Q., 2013. "Transportation service procurement in periodic sealed double auctions with stochastic demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 136-160.
    24. Leon Yang Chu & Zuo-Jun Max Shen, 2006. "Agent Competition Double-Auction Mechanism," Management Science, INFORMS, vol. 52(8), pages 1215-1222, August.
    25. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    26. Huang, George Q. & Xu, Su Xiu, 2013. "Truthful multi-unit transportation procurement auctions for logistics e-marketplaces," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 127-148.
    27. Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-631, July.
    Full references (including those not matched with items on IDEAS)

    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. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    2. Guo, Jiantao & Zhang, Juliang & Cheng, T.C.E. & Zhao, Shouting, 2022. "Truthful double auction mechanisms for online freight platforms with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 164-186.
    3. Liang, Renchao & Wang, Junwei & Huang, Min & Jiang, Zhong-Zhong, 2020. "Truthful auctions for e-market logistics services procurement with quantity discounts," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 165-180.
    4. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," Games and Economic Behavior, Elsevier, vol. 105(C), pages 59-83.
    5. Dilip Mookherjee, 2008. "The 2007 Nobel Memorial Prize in Mechanism Design Theory," Scandinavian Journal of Economics, Wiley Blackwell, vol. 110(2), pages 237-260, June.
    6. Leon Yang Chu, 2009. "Truthful Bundle/Multiunit Double Auctions," Management Science, INFORMS, vol. 55(7), pages 1184-1198, July.
    7. Leon Yang Chu & Zuo-Jun Max Shen, 2008. "Truthful Double Auction Mechanisms," Operations Research, INFORMS, vol. 56(1), pages 102-120, February.
    8. Dütting, Paul & Talgam-Cohen, Inbal & Roughgarden, Tim, 2017. "Modularity and greed in double auctions," LSE Research Online Documents on Economics 83199, London School of Economics and Political Science, LSE Library.
    9. Xu, Su Xiu & Cheng, Meng & Huang, George Q., 2015. "Efficient intermodal transportation auctions for B2B e-commerce logistics with transaction costs," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 322-337.
    10. Su Xiu Xu & George Q. Huang & Meng Cheng, 2017. "Truthful, Budget-Balanced Bundle Double Auctions for Carrier Collaboration," Transportation Science, INFORMS, vol. 51(4), pages 1365-1386, November.
    11. Xiao, Haohan & Xu, Meng & Yang, Hai, 2020. "Pricing strategies for shared parking management with double auction approach: Differential price vs. uniform price," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    12. Kong, Xiang T.R. & Kang, Kai & Zhong, Ray Y. & Luo, Hao & Xu, Su Xiu, 2021. "Cyber physical system-enabled on-demand logistics trading," International Journal of Production Economics, Elsevier, vol. 233(C).
    13. Jiasen Sun & Guo Li, 2020. "Designing a double auction mechanism for the re-allocation of emission permits," Annals of Operations Research, Springer, vol. 291(1), pages 847-874, August.
    14. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.
    15. Cheng, Meng & Xu, Su Xiu & Huang, George Q., 2016. "Truthful multi-unit multi-attribute double auctions for perishable supply chain trading," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 21-37.
    16. Sun, Jiasen & Li, Guo & Xu, Su Xiu & Dai, Wei, 2019. "Intermodal transportation service procurement with transaction costs under belt and road initiative," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 127(C), pages 31-48.
    17. Delacrétaz, David & Loertscher, Simon & Marx, Leslie M. & Wilkening, Tom, 2019. "Two-sided allocation problems, decomposability, and the impossibility of efficient trade," Journal of Economic Theory, Elsevier, vol. 179(C), pages 416-454.
    18. Xu, Su Xiu & Huang, George Q., 2013. "Transportation service procurement in periodic sealed double auctions with stochastic demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 56(C), pages 136-160.
    19. Huang, George Q. & Xu, Su Xiu, 2013. "Truthful multi-unit transportation procurement auctions for logistics e-marketplaces," Transportation Research Part B: Methodological, Elsevier, vol. 47(C), pages 127-148.
    20. 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.

    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:109:y:2018:i:c:p:40-69. 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.