Pricing with a Hidden Sample
Author
Abstract
Suggested Citation
Download full text from publisher
References listed on IDEAS
- Shixin Wang, 2025. "The Power of Simple Menus in Robust Selling Mechanisms," Management Science, INFORMS, vol. 71(6), pages 5268-5287, June.
- Carrasco, Vinicius & Farinha Luz, Vitor & Kos, Nenad & Messner, Matthias & Monteiro, Paulo & Moreira, Humberto, 2018. "Optimal selling mechanisms under moment conditions," Journal of Economic Theory, Elsevier, vol. 177(C), pages 245-279.
- Paul Milgrom & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
- Schweizer, Nikolaus & Szech, Nora, 2015.
"The quantitative view of Myerson regularity,"
Discussion Papers, Research Unit: Economics of Change
SP II 2015-307, WZB Berlin Social Science Center.
- Nikolaus Schweizer & Nora Szech, 2016. "The Quantitative View of Myerson Regularity," CESifo Working Paper Series 5712, CESifo.
- Songzi Du, 2018. "Robust Mechanisms Under Common Valuation," Econometrica, Econometric Society, vol. 86(5), pages 1569-1588, September.
- Dirk Bergemann & Karl H. Schlag, 2012.
"Pricing Without Priors,"
World Scientific Book Chapters, in: Robust Mechanism Design The Role of Private Information and Higher Order Beliefs, chapter 12, pages 405-415,
World Scientific Publishing Co. Pte. Ltd..
- Dirk Bergemann & Karl H. Schlag, 2008. "Pricing without Priors," Journal of the European Economic Association, MIT Press, vol. 6(2-3), pages 560-569, 04-05.
- Dirk Bergemann & Karl H Schlag, 2007. "Pricing without Priors," Levine's Bibliography 122247000000001557, UCLA Department of Economics.
- Dirk Bergemann & Karl H. Schlag, 2007. "Pricing without Priors," Cowles Foundation Discussion Papers 1625, Cowles Foundation for Research in Economics, Yale University.
- René Caldentey & Ying Liu & Ilan Lobel, 2017. "Intertemporal Pricing Under Minimax Regret," Operations Research, INFORMS, vol. 65(1), pages 104-129, February.
- Amine Allouah & Achraf Bahamou & Omar Besbes, 2023. "Optimal Pricing with a Single Point," Management Science, INFORMS, vol. 69(10), pages 5866-5882, October.
- Gneiting, Tilmann & Raftery, Adrian E., 2007. "Strictly Proper Scoring Rules, Prediction, and Estimation," Journal of the American Statistical Association, American Statistical Association, vol. 102, pages 359-378, March.
- René Caldentey & Ying Liu & Ilan Lobel, 2017. "Intertemporal Pricing Under Minimax Regret," Operations Research, INFORMS, vol. 65(1), pages 104-129, February.
- Bernard Caillaud & Jacques Robert, 2005. "Implementation of the revenue-maximizing auction by an ignorant seller," Review of Economic Design, Springer;Society for Economic Design, vol. 9(2), pages 127-143, April.
- Shixin Wang & Shaoxuan Liu & Jiawei Zhang, 2024. "Minimax Regret Robust Screening with Moment Information," Manufacturing & Service Operations Management, INFORMS, vol. 26(3), pages 992-1012, May.
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.- Han, Jun & Weber, Thomas A., 2023. "Price discrimination with robust beliefs," European Journal of Operational Research, Elsevier, vol. 306(2), pages 795-809.
- Shixin Wang, 2024. "Multi-Item Screening with a Maximin-Ratio Objective," Papers 2408.13580, arXiv.org, revised Oct 2025.
- Wanchang Zhang, 2022. "Auctioning Multiple Goods without Priors," Papers 2204.13726, arXiv.org.
- Shixin Wang, 2023. "The Power of Simple Menus in Robust Selling Mechanisms," Papers 2310.17392, arXiv.org, revised Sep 2024.
- Çağıl Koçyiğit & Daniel Kuhn & Napat Rujeerapaiboon, 2024. "Regret Minimization and Separation in Multi-Bidder, Multi-Item Auctions," INFORMS Journal on Computing, INFORMS, vol. 36(6), pages 1543-1561, December.
- Thomas A. Weber, 2023. "Relatively robust decisions," Theory and Decision, Springer, vol. 94(1), pages 35-62, January.
- Yeon-Koo Che & Weijie Zhong, 2021. "Robustly Optimal Mechanisms for Selling Multiple Goods," Papers 2105.02828, arXiv.org, revised Aug 2024.
- Amine Allouah & Omar Besbes, 2020. "Prior-Independent Optimal Auctions," Management Science, INFORMS, vol. 66(10), pages 4417-4432, October.
- Chengzhang Li & Mengshi Lu, 2023. "Joint pricing and inventory management under minimax regret," Production and Operations Management, Production and Operations Management Society, vol. 32(8), pages 2529-2545, August.
- Bernhard Kasberger & Karl H. Schlag, 2017. "Robust Bidding in First-Price Auctions: How to Bid without Knowing what Otheres are Doing," Vienna Economics Papers 1707, University of Vienna, Department of Economics.
- Bernhard Kasberger & Karl H. Schlag, 2024.
"Robust Bidding in First-Price Auctions: How to Bid Without Knowing What Others Are Doing,"
Management Science, INFORMS, vol. 70(7), pages 4219-4235, July.
- Bernhard Kasberger & Karl H. Schlag, 2017. "Robust Bidding in First-Price Auctions: How to Bid without Knowing what Otheres are Doing," Vienna Economics Papers vie1707, University of Vienna, Department of Economics.
- Ju Hu & Xi Weng, 2021. "Robust persuasion of a privately informed receiver," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(3), pages 909-953, October.
- Duarte Gonc{c}alves & Bruno A. Furtado, 2024. "Statistical Mechanism Design: Robust Pricing, Estimation, and Inference," Papers 2405.17178, arXiv.org.
- Wanchang Zhang, 2021. "Random Double Auction: A Robust Bilateral Trading Mechanism," Papers 2105.05427, arXiv.org, revised May 2022.
- Suzdaltsev, Alex, 2022.
"Distributionally robust pricing in independent private value auctions,"
Journal of Economic Theory, Elsevier, vol. 206(C).
- Alex Suzdaltsev, 2020. "Distributionally Robust Pricing in Independent Private Value Auctions," Papers 2008.01618, arXiv.org, revised Aug 2020.
- Zhang, Guoquan & Li, Guohao & Shang, Jennifer, 2023. "Optimizing mixed bundle pricing strategy: Advance selling and consumer regret," Omega, Elsevier, vol. 115(C).
- Anthony Coache & Sebastian Jaimungal, 2024. "Robust Reinforcement Learning with Dynamic Distortion Risk Measures," Papers 2409.10096, arXiv.org, revised Sep 2025.
- Wang, Wei & Lan, Yingjie, 2022. "Robust one-way trading with limited number of transactions and heuristics for fixed transaction costs," International Journal of Production Economics, Elsevier, vol. 247(C).
- Ethan Che, 2019. "Distributionally Robust Optimal Auction Design under Mean Constraints," Papers 1911.07103, arXiv.org, revised Feb 2022.
- Xu, Xiaoyan & Choi, Tsan-Ming & Chung, Sai-Ho & Guo, Shu, 2023. "Collaborative-commerce in supply chains: A review and classification of analytical models," International Journal of Production Economics, Elsevier, vol. 263(C).
More about this item
NEP fields
This paper has been announced in the following NEP Reports:- NEP-DES-2026-03-02 (Economic Design)
- NEP-INV-2026-03-02 (Investment)
- NEP-MIC-2026-03-02 (Microeconomics)
Statistics
Access and download statisticsCorrections
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:2602.18038. 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.
Printed from https://ideas.repec.org/p/arx/papers/2602.18038.html