IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1807.06822.html
   My bibliography  Save this paper

Customer Sharing in Economic Networks with Costs

Author

Listed:
  • Bin Li
  • Dong Hao
  • Dengji Zhao
  • Tao Zhou

Abstract

In an economic market, sellers, infomediaries and customers constitute an economic network. Each seller has her own customer group and the seller's private customers are unobservable to other sellers. Therefore, a seller can only sell commodities among her own customers unless other sellers or infomediaries share her sale information to their customer groups. However, a seller is not incentivized to share others' sale information by default, which leads to inefficient resource allocation and limited revenue for the sale. To tackle this problem, we develop a novel mechanism called customer sharing mechanism (CSM) which incentivizes all sellers to share each other's sale information to their private customer groups. Furthermore, CSM also incentivizes all customers to truthfully participate in the sale. In the end, CSM not only allocates the commodities efficiently but also optimizes the seller's revenue.

Suggested Citation

  • Bin Li & Dong Hao & Dengji Zhao & Tao Zhou, 2018. "Customer Sharing in Economic Networks with Costs," Papers 1807.06822, arXiv.org.
    • Handle: RePEc:arx:papers:1807.06822
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1807.06822
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Hervé Moulin & Scott Shenker, 2001. "Strategyproof sharing of submodular costs:budget balance versus efficiency," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 18(3), pages 511-533.
    2. 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.
    3. William Vickrey, 1961. "Counterspeculation, Auctions, And Competitive Sealed Tenders," Journal of Finance, American Finance Association, vol. 16(1), pages 8-37, March.
    4. Myerson, Roger B. & Satterthwaite, Mark A., 1983. "Efficient mechanisms for bilateral trading," Journal of Economic Theory, Elsevier, vol. 29(2), pages 265-281, April.
    5. Rachel R. Chen & Robin O. Roundy & Rachel Q. Zhang & Ganesh Janakiraman, 2005. "Efficient Auction Mechanisms for Supply Chain Procurement," Management Science, INFORMS, vol. 51(3), pages 467-482, March.
    6. Edward Clarke, 1971. "Multipart pricing of public goods," Public Choice, Springer, vol. 11(1), pages 17-33, September.
    7. 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)

    Citations

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


    Cited by:

    1. Rangeet Bhattacharyya & Parvik Dave & Palash Dey & Swaprava Nath, 2022. "Optimal Referral Auction Design," Papers 2208.09326, arXiv.org, revised Jul 2023.
    2. Mrinal SAIKIA & Prakash DAS & Disha NEOG, 2023. "Evolution of growth theory: from Harrod to Romer," Theoretical and Applied Economics, Asociatia Generala a Economistilor din Romania / Editura Economica, vol. 0(2(635), S), pages 125-138, Summer.
    3. Herrmann-Pillath, Carsten, 2023. "The universal commons: An economic theory of ecosystem ownership," Ecological Economics, Elsevier, vol. 208(C).
    4. Yuhang Guo & Dong Hao & Bin Li, 2022. "Combinatorial Procurement Auction in Social Networks," Papers 2208.14591, arXiv.org.
    5. Dengji Zhao, 2021. "Mechanism Design Powered by Social Interactions," Papers 2102.10347, arXiv.org.
    6. Bin Li & Dong Hao & Dengji Zhao, 2020. "Incentive-Compatible Diffusion Auctions," Papers 2001.06975, arXiv.org, revised Apr 2020.

    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. 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.
    2. 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.
    3. Thierry Marchant & Debasis Mishra, 2015. "Mechanism design with two alternatives in quasi-linear environments," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(2), pages 433-455, February.
    4. Rica Gonen & Erel Segal-Halevi, 2019. "Strongly Budget Balanced Auctions for Multi-Sided Markets," Papers 1911.08094, arXiv.org, revised Dec 2019.
    5. Yi, Jianxin & Li, Yong, 2016. "A general impossibility theorem and its application to individual rights," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 79-86.
    6. 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).
    7. 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.
    8. Leon Yang Chu & Zuo-Jun Max Shen, 2008. "Truthful Double Auction Mechanisms," Operations Research, INFORMS, vol. 56(1), pages 102-120, February.
    9. Lau, Stephanie, 2011. "Investment incentives in bilateral trading," Games and Economic Behavior, Elsevier, vol. 73(2), pages 538-552.
    10. Tafreshian, Amirmahdi & Masoud, Neda, 2022. "A truthful subsidy scheme for a peer-to-peer ridesharing market with incomplete information," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 130-161.
    11. Loertscher, Simon & Mezzetti, Claudio, 2021. "A dominant strategy, double clock auction with estimation-based tatonnement," Theoretical Economics, Econometric Society, vol. 16(3), July.
    12. David C. Parkes & Jayant Kalagnanam, 2005. "Models for Iterative Multiattribute Procurement Auctions," Management Science, INFORMS, vol. 51(3), pages 435-451, March.
    13. Song, Yangwei, 2018. "Efficient Implementation with Interdependent Valuations and Maxmin Agents," Rationality and Competition Discussion Paper Series 92, CRC TRR 190 Rationality and Competition.
    14. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2014. "Egalitarian equivalence and strategyproofness in the queueing problem," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(2), pages 425-442, June.
    15. Kazumura, Tomoya & Mishra, Debasis & Serizawa, Shigehiro, 2020. "Mechanism design without quasilinearity," Theoretical Economics, Econometric Society, vol. 15(2), May.
    16. Philippe Jehiel & Laurent Lamy, 2018. "A Mechanism Design Approach to the Tiebout Hypothesis," Journal of Political Economy, University of Chicago Press, vol. 126(2), pages 735-760.
    17. repec:cte:werepe:we081207 is not listed on IDEAS
    18. Yoon, Kiho, 2008. "The participatory Vickrey-Clarke-Groves mechanism," Journal of Mathematical Economics, Elsevier, vol. 44(3-4), pages 324-336, February.
    19. Matsushima, Hitoshi & Noda, Shunya, 2023. "Mechanism design with general ex-ante investments," Journal of Mathematical Economics, Elsevier, vol. 106(C).
    20. Schnizler, Bjorn & Neumann, Dirk & Veit, Daniel & Weinhardt, Christof, 2008. "Trading grid services - a multi-attribute combinatorial approach," European Journal of Operational Research, Elsevier, vol. 187(3), pages 943-961, June.
    21. 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.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:arx:papers:1807.06822. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.