IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/105971.html
   My bibliography  Save this paper

Treating Symmetric Buyers Asymmetrically

Author

Listed:
  • Banerjee, Shraman

Abstract

We investigate a finite-horizon dynamic pricing problem of a seller under limited commitment. Even when the buyers are ex-ante symmetric to the seller, the seller can charge different prices to different buyers. We show that under the class of posted-price mechanisms this asymmetric treatment of symmetric buyers strictly revenue-dominates symmetric treatment. The seller im- plements this by using a priority-based deterministic tie-breaking rule instead of using a random tie-breaking rule. The effect of asymmetric treatment on revenue increment increases monotonically as we increase the time horizon of the game.

Suggested Citation

  • Banerjee, Shraman, 2021. "Treating Symmetric Buyers Asymmetrically," MPRA Paper 105971, University Library of Munich, Germany.
    • Handle: RePEc:pra:mprapa:105971
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/105971/1/MPRA_paper_105971.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Johannes Hörner & Larry Samuelson, 2011. "Managing Strategic Buyers," Journal of Political Economy, University of Chicago Press, vol. 119(3), pages 379-425.
    2. Skreta, Vasiliki, 2015. "Optimal auction design under non-commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 854-890.
    3. Gershkov, Alex & Moldovanu, Benny, 2010. "Efficient sequential assignment with incomplete information," Games and Economic Behavior, Elsevier, vol. 68(1), pages 144-154, January.
    4. Pascal Courty & Li Hao, 2000. "Sequential Screening," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 67(4), pages 697-717.
    5. Jérémie Gallien, 2006. "Dynamic Mechanism Design for Online Commerce," Operations Research, INFORMS, vol. 54(2), pages 291-310, April.
    6. Simon Board & Andrzej Skrzypacz, 2016. "Revenue Management with Forward-Looking Buyers," Journal of Political Economy, University of Chicago Press, vol. 124(4), pages 1046-1087.
    7. Chia-Hui Chen, 2012. "Name Your Own Price at Priceline.com: Strategic Bidding and Lockout Periods," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 79(4), pages 1341-1369.
    8. Roger B. Myerson, 1981. "Optimal Auction Design," Mathematics of Operations Research, INFORMS, vol. 6(1), pages 58-73, February.
    9. Péter Eső & Balázs Szentes, 2007. "Optimal Information Disclosure in Auctions and the Handicap Auction," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 74(3), pages 705-731.
    10. Marco Battaglini, 2005. "Long-Term Contracting with Markovian Consumers," American Economic Review, American Economic Association, vol. 95(3), pages 637-658, June.
    11. Hammond, Robert G., 2010. "Comparing revenue from auctions and posted prices," International Journal of Industrial Organization, Elsevier, vol. 28(1), pages 1-9, January.
    12. Hammond, Robert G., 2013. "A structural model of competing sellers: Auctions and posted prices," European Economic Review, Elsevier, vol. 60(C), pages 52-68.
    13. Kotowski, Maciej H., 2018. "On asymmetric reserve prices," Theoretical Economics, Econometric Society, vol. 13(1), January.
    14. Liran Einav & Chiara Farronato & Jonathan D. Levin & Neel Sundaresan, 2013. "Sales Mechanisms in Online Markets: What Happened to Internet Auctions?," NBER Working Papers 19021, National Bureau of Economic Research, Inc.
    15. Vasiliki Skreta, 2006. "Sequentially Optimal Mechanisms -super-1," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 73(4), pages 1085-1111.
    16. Mallesh M. Pai & Rakesh Vohra, 2013. "Optimal Dynamic Auctions and Simple Index Rules," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 682-697, November.
    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. Shraman Banerjee, 2024. "Treating symmetric buyers asymmetrically," International Journal of Economic Theory, The International Society for Economic Theory, vol. 20(2), pages 159-181, June.
    2. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
    3. Sham M. Kakade & Ilan Lobel & Hamid Nazerzadeh, 2013. "Optimal Dynamic Mechanism Design and the Virtual-Pivot Mechanism," Operations Research, INFORMS, vol. 61(4), pages 837-854, August.
    4. Tao Zhang & Quanyan Zhu, 2019. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Papers 1909.13720, arXiv.org, revised May 2021.
    5. Qingmin Liu & Konrad Mierendorff & Xianwen Shi & Weijie Zhong, 2019. "Auctions with Limited Commitment," American Economic Review, American Economic Association, vol. 109(3), pages 876-910, March.
    6. Emil Temnyalov, 2019. "Points mechanisms and rewards programs," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(3), pages 436-457, June.
    7. Shraman Banerjee, 2022. "Treating Symmetric Buyers Asymmetrically," Working Papers 2022-02, Shiv Nadar University, Department of Economics.
    8. Deb, Rahul & Said, Maher, 2015. "Dynamic screening with limited commitment," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 891-928.
    9. Tao Zhang & Quanyan Zhu, 2022. "On Incentive Compatibility in Dynamic Mechanism Design With Exit Option in a Markovian Environment," Dynamic Games and Applications, Springer, vol. 12(2), pages 701-745, June.
    10. Garrett, Daniel F., 2017. "Dynamic mechanism design: Dynamic arrivals and changing values," Games and Economic Behavior, Elsevier, vol. 104(C), pages 595-612.
    11. Mierendorff, Konrad, 2016. "Optimal dynamic mechanism design with deadlines," Journal of Economic Theory, Elsevier, vol. 161(C), pages 190-222.
    12. Artyom Shneyerov, 2014. "An optimal slow Dutch auction," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 57(3), pages 577-602, November.
    13. Bergemann, Dirk & Pavan, Alessandro, 2015. "Introduction to Symposium on Dynamic Contracts and Mechanism Design," Journal of Economic Theory, Elsevier, vol. 159(PB), pages 679-701.
    14. Santiago R. Balseiro & Omar Besbes & Gabriel Y. Weintraub, 2019. "Dynamic Mechanism Design with Budget-Constrained Buyers Under Limited Commitment," Operations Research, INFORMS, vol. 67(3), pages 711-730, May.
    15. Yiwei Chen & Nikolaos Trichakis, 2021. "Technical Note—On Revenue Management with Strategic Customers Choosing When and What to Buy," Operations Research, INFORMS, vol. 69(1), pages 175-187, January.
    16. Dirk Bergemann & Alessandro Pavan, 2015. "Introduction to JET Symposium Issue on "Dynamic Contracts and Mechanism Design"," Cowles Foundation Discussion Papers 2016, Cowles Foundation for Research in Economics, Yale University.
    17. Caio Waisman, 2021. "Selling mechanisms for perishable goods: An empirical analysis of an online resale market for event tickets," Quantitative Marketing and Economics (QME), Springer, vol. 19(2), pages 127-178, June.
    18. Ying-Ju Chen, 2011. "Optimal Selling Scheme for Heterogeneous Consumers with Uncertain Valuations," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 695-720, November.
    19. Arieh Gavious & Ella Segev, 2017. "Price Discrimination Based on Buyers’ Purchase History," Dynamic Games and Applications, Springer, vol. 7(2), pages 229-265, June.
    20. Vibhanshu Abhishek & Mustafa Dogan & Alexandre Jacquillat, 2021. "Strategic Timing and Dynamic Pricing for Online Resource Allocation," Management Science, INFORMS, vol. 67(8), pages 4880-4907, August.

    More about this item

    Keywords

    Dynamic Pricing; Asymmetric Mechanism; Non-Anonymity;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • D42 - Microeconomics - - Market Structure, Pricing, and Design - - - Monopoly
    • D44 - Microeconomics - - Market Structure, Pricing, and Design - - - Auctions
    • D82 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Asymmetric and Private Information; Mechanism Design

    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:pra:mprapa:105971. 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: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    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.