When and Where To Submit A Paper (2402.01745v1)
Abstract: What is the optimal order in which a researcher should submit their papers to journals of differing quality? I analyze a sequential search model without recall where the researcher's expected value from journal submission depends on the history of past submissions. Acceptances immediately terminate the search process and deliver some payoff, while rejections carry information about the paper's quality, affecting the researcher's belief in acceptance probability over future journals. When journal feedback does not change the paper's quality, the researcher's optimal strategy is monotone in their acceptance payoff. Submission costs distort the researcher's effective acceptance payoff, but maintain monotone optimality. If journals give feedback which can affect the paper's quality, such as through \textit{referee reports}, the search order can change drastically depending on the agent's prior belief about their paper's quality. However, I identify a set of \textit{assortative matched} conditions on feedback such that monotone strategies remain optimal whenever the agent's prior is sufficiently optimistic.
- Au, Pak Hung, and Mark Whitmeyer. 2023. “Attraction versus Persuasion: Information Provision in Search Markets.” Journal of Political Economy 131 (1): . 10.1086/720984.
- Board, S., and J. Lu. 2018. “Competitive Information Disclosure in Search Markets.” Journal of Political Economy 126 (5): . 10.1086/699211.
- Chade, Hector, and Lones Smith. 2006. “Simultaneous Search.” Econometrica 74 (5): 1293–1307.
- Che, Yeon-Koo, and Konrad Mierendorff. 2019. “Optimal Dynamic Allocation of Attention.” American Economic Review 109 (8): 2993–3029. 10.1257/aer.20171000.
- Doval, Laura. 2018. “Whether or Not to Open Pandora’s Box.” Journal of Economic Theory 175 127–158.
- Gittins, J. C. 1979. “Bandit Processes and Dynamic Allocation Indices.” Journal of the Royal Statistical Society. Series B (Methodological) 41 (2): 148–177.
- He, Wei, and Jiangtao Li. 2023. “Competitive information disclosure in random search markets.” Games and Economic Behavior 140 132–153.
- Ke, T. Tony, and J. Miguel Villas-Boas. 2019. “Optimal Learning Before Choice.” Journal of Economic Theory 180 383–437.
- Morgan, P., and R. Manning. 1985. “Optimal Search.” Econometrica 53 (4): 923–944. 10.2307/1912661.
- Nino-Mora, Jose. 2023. “Markovian Restless Bandits and Index Policies: A Review.” Mathematics 11 (7): 1639. 10.3390/math11071639.
- Olszewski, Wojciech, and Richard Weber. 2015. “A More General Pandora Rule?” Journal of Economic Theory 160 429–437.
- Papadimitriou, Christos H., and John N. Tsitsiklis. 1999. “The Complexity of Optimal Queuing Network Control.” Mathematics of Operations Research 24 (2): 293–305, https://www.jstor.org/stable/3690486, Contribution from INFORMS.
- Sato, H., and R. Shirakawa. 2023b. “Title.” Journal, https://papers.ssrn.com/sol3/papers.cfm?abstract_id=4483732, SSRN.
- Sato, Hiroto, and Ryo Shirakawa. 2023a. “Information Design in Pandora’s Problem.” arXiv preprint arXiv:YYYY.MMDD, 36 Pages.
- Vishwanath, T. 1992. “Parallel Search for the Best Alternative.” Economic Theory 2 (4): 495–507, https://EconPapers.repec.org/RePEc:spr:joecth:v:2:y:1992:i:4:p:495-507.
- Wald, Abraham. 1947. “Foundations of a General Theory of Sequential Decision Functions.” Econometrica 15 (4): 279–313.
- Weitzman, Martin. 1979. “Optimal Search for the Best Alternative.” Econometrica 47.
- Whittle, P. 1988. “Restless Bandits: Activity Allocation in a Changing World.” Journal of Applied Probability 25 287–298. 10.2307/3214163, A Celebration of Applied Probability.
- Zhou, Jidong. 2011. “Ordered search in differentiated markets.” International Journal of Industrial Organization 29 (2): 253–262. 10.1016/j.ijindorg.2010.07.001.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.