IDEAS home Printed from https://ideas.repec.org/r/nwu/cmsems/1574.html

Whether or not to open Pandora's box

Citations

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


Cited by:

  1. Mohammad Reza Aminian & Vahideh Manshadi & Rad Niazadeh, 2025. "Markovian Search with Ex-Ante Constraints: Theory and Applications to Socially Aware Algorithmic Hiring," Papers 2501.13346, arXiv.org, revised Oct 2025.
  2. Elchanan Ben-Porath & Eddie Dekel & Barton L. Lipman, 2014. "Optimal Allocation with Costly Verification," American Economic Review, American Economic Association, vol. 104(12), pages 3779-3813, December.
  3. Jochen Schlapp & Gerrit Schumacher, 2022. "Delegated Concept Testing in New Product Development," Operations Research, INFORMS, vol. 70(5), pages 2732-2748, September.
  4. Qi (George) Chen & Damian R. Beil & Izak Duenyas, 2022. "Procurement Mechanisms with Post-Auction Pre-Award Cost-Reduction Investigations," Operations Research, INFORMS, vol. 70(6), pages 3054-3075, November.
  5. Saeed Alaei & Ali Makhdoumi & Azarakhsh Malekian, 2025. "Revenue Maximization Under Unknown Private Values with Nonobligatory Inspection," Operations Research, INFORMS, vol. 73(3), pages 1307-1319, May.
  6. Ziv Scully & Laura Doval, 2024. "Local hedging approximately solves Pandora's box problems with nonobligatory inspection," Papers 2410.19011, arXiv.org, revised Jan 2025.
  7. Carol Gao & Jorge Vásquez, 2025. "Optimal policing with (and without) criminal search," Review of Economic Design, Springer;Society for Economic Design, vol. 29(2), pages 213-244, June.
  8. Liang Guo, 2021. "Endogenous Evaluation and Sequential Search," Marketing Science, INFORMS, vol. 40(3), pages 413-427, May.
  9. Pak Hung Au & Mark Whitmeyer, 2018. "Attraction versus Persuasion: Information Provision in Search Markets," Papers 1802.09396, arXiv.org, revised May 2022.
  10. Hedyeh Beyhaghi & Linda Cai, 2023. "Recent Developments in Pandora's Box Problem: Variants and Applications," Papers 2308.12242, arXiv.org.
  11. Noda, Shunya, 2022. "Strategic experimentation with random serial dictatorship," Games and Economic Behavior, Elsevier, vol. 133(C), pages 115-125.
  12. Ke, T. Tony & Villas-Boas, J. Miguel, 2019. "Optimal learning before choice," Journal of Economic Theory, Elsevier, vol. 180(C), pages 383-437.
  13. Manuel Mueller-Frank & Mallesh M. Pai, 2016. "Social Learning with Costly Search," American Economic Journal: Microeconomics, American Economic Association, vol. 8(1), pages 83-109, February.
  14. David B. Brown & Cagin Uru, 2024. "Sequential Search with Acquisition Uncertainty," Management Science, INFORMS, vol. 70(11), pages 7712-7729, November.
  15. Gretschko, Vitali & Simon, Jasmina, 2024. "An efficient dynamic mechanism with covert information acquisition," ZEW Discussion Papers 24-081, ZEW - Leibniz Centre for European Economic Research.
  16. Rustamdjan Hakimov & Dorothea Kübler & Siqi Pan, 2023. "Costly information acquisition in centralized matching markets," Quantitative Economics, Econometric Society, vol. 14(4), pages 1447-1490, November.
  17. Li, Yunan, 2020. "Mechanism design with costly verification and limited punishments," Journal of Economic Theory, Elsevier, vol. 186(C).
  18. Mohammad T. Hajiaghayi & Suho Shin, 2025. "Algorithmic Delegated Choice: An Annotated Reading List," Papers 2508.06562, arXiv.org, revised Aug 2025.
  19. Grenet, Julien & He, Yinghua & Kübler, Dorothea, 2019. "Decentralizing centralized matching markets: Implications from early offers in university admissions," Discussion Papers, Research Unit: Market Behavior SP II 2019-208, WZB Berlin Social Science Center.
  20. Greminger, Rafael, 2019. "Optimal Search and Awareness Expansion," Other publications TiSEM ac47e6ff-42a4-4d70-addd-6, Tilburg University, School of Economics and Management.
  21. Julien Grenet & YingHua He & Dorothea Kübler, 2022. "Preference Discovery in University Admissions: The Case for Dynamic Multioffer Mechanisms," Journal of Political Economy, University of Chicago Press, vol. 130(6), pages 1427-1476.
  22. Weijie Zhong, 2022. "Optimal Dynamic Information Acquisition," Econometrica, Econometric Society, vol. 90(4), pages 1537-1582, July.
  23. T. Tony Ke & Song Lin, 2020. "Informational Complementarity," Management Science, INFORMS, vol. 66(8), pages 3699-3716, August.
  24. Fudenberg, Drew & He, Kevin, 2021. "Player-compatible learning and player-compatible equilibrium," Journal of Economic Theory, Elsevier, vol. 194(C).
  25. José Correa & Andrés Cristi & Laurent Feuilloley & Tim Oosterwijk & Alexandros Tsigonias-Dimitriadis, 2025. "The Secretary Problem with Independent Sampling," Management Science, INFORMS, vol. 71(4), pages 2778-2801, April.
  26. Efthymios Lykopoulos & Georgios Voucharas & Dimitrios Xefteris, 2022. "Pandora’s rules in the laboratory," Experimental Economics, Springer;Economic Science Association, vol. 25(5), pages 1492-1514, November.
  27. Chenguang (Allen) Wu & Chen Jin & Ying-Ju Chen, 2022. "Managing Customer Search via Bundling," Manufacturing & Service Operations Management, INFORMS, vol. 24(4), pages 1906-1925, July.
  28. Rafael P. Greminger, 2019. "Optimal Search and Discovery," Papers 1911.07773, arXiv.org, revised Feb 2022.
  29. Dellis, Arnaud, 2023. "Legislative informational lobbying," Journal of Economic Theory, Elsevier, vol. 208(C).
  30. Sreekumar Bhaskaran & Sanjiv Erat, 2025. "Optimal Prototyping with Noisy Measurements," Manufacturing & Service Operations Management, INFORMS, vol. 27(1), pages 322-338, January.
  31. Ben Berger & Tomer Ezra & Michal Feldman & Federico Fusco, 2025. "Pandora’s Problem with Combinatorial Cost," Mathematics of Operations Research, INFORMS, vol. 50(4), pages 3161-3189, November.
  32. Ali Aouad & Jingwei Ji & Yaron Shaposhnik, 2025. "The Pandora's Box Problem with Sequential Inspections," Papers 2507.07508, arXiv.org, revised Apr 2026.
  33. Mohammad T. Hajiaghayi & Piotr Krysta & Mohammad Mahdavi & Suho Shin, 2025. "Delegation with Costly Inspection," Papers 2506.07162, arXiv.org, revised Jun 2025.
  34. Geoffrey A. Chua & Gaoji Hu & Fang Liu, 2023. "Optimal multi-unit allocation with costly verification," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 61(3), pages 455-488, October.
  35. Chen, Yanbin & Li, Sanxi & Lin, Kai & Yu, Jun, 2021. "Consumer search with blind buying," Games and Economic Behavior, Elsevier, vol. 126(C), pages 402-427.
  36. Petrikaitė, Vaiva, 2022. "Escaping search when buying," International Journal of Industrial Organization, Elsevier, vol. 82(C).
  37. Federico Bobbio & Randall A. Berry & Michael L. Honig & Thanh Nguyen & Vijay G. Subramanian & Rakesh V. Vohra, 2025. "Sharing with Frictions: Limited Transfers and Costly Inspections," Papers 2512.21793, arXiv.org.
  38. Tianxin Zou & Bo Zhou, 2025. "Self-Preferencing and Search Neutrality in Online Retail Platforms," Management Science, INFORMS, vol. 71(5), pages 4087-4107, May.
  39. Rafael P. Greminger, 2022. "Optimal Search and Discovery," Management Science, INFORMS, vol. 68(5), pages 3904-3924, May.
  40. Minghua Chen & Konstantinos Serfes & Eleftherios Zacharias, 2023. "Prices as signals of product quality in a duopoly," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(1), pages 1-31, March.
  41. Maxey, Tyler, 2024. "School choice with costly information acquisition," Games and Economic Behavior, Elsevier, vol. 143(C), pages 248-268.
  42. Greminger, Rafael, 2019. "Optimal Search and Awareness Expansion," Discussion Paper 2019-034, Tilburg University, Center for Economic Research.
  43. Shant Boodaghians & Federico Fusco & Philip Lazos & Stefano Leonardi, 2023. "Pandora’s Box Problem with Order Constraints," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 498-519, February.
  44. Mark Armstrong, 2017. "Ordered Consumer Search," Journal of the European Economic Association, European Economic Association, vol. 15(5), pages 989-1024.
  45. Christoph Carnehl & Johannes Schneider, 2023. "On Risk and Time Pressure: When to Think and When to Do," Journal of the European Economic Association, European Economic Association, vol. 21(1), pages 1-47.
  46. Yunan Li, 2017. "Mechanism Design with Costly Verification and Limited Punishments, Third Version," PIER Working Paper Archive 16-009, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Sep 2017.
  47. Agastya, Murali & Feng, Xin & Lu, Jingfeng, 2023. "Auction design with shortlisting when value discovery is covert," Journal of Mathematical Economics, Elsevier, vol. 107(C).
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.