Priority Auctions and Queue Disciplines that Depend on Processing Time

Citations

Cited by:

1. Anouar El Haji & Sander Onderstal, 2019. "Trading places: An experimental comparison of reallocation mechanisms for priority queuing," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 28(4), pages 670-686, November.
   • Anouar El Haji & Sander Onderstal, 2015. "Trading Places: An Experimental Comparison of Reallocation Mechanisms for Priority Queuing," Tinbergen Institute Discussion Papers 15-063/VII, Tinbergen Institute.
2. Becker, Kai Helge, 2016. "An outlook on behavioural OR – Three tasks, three pitfalls, one definition," European Journal of Operational Research, Elsevier, vol. 249(3), pages 806-815.
3. Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007. "Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords," American Economic Review, American Economic Association, vol. 97(1), pages 242-259, March.
   • Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2005. "Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords," NBER Working Papers 11765, National Bureau of Economic Research, Inc.
4. Gershkov, Alex & Moldovanu, Benny, 2012. "Optimal search, learning and implementation," Journal of Economic Theory, Elsevier, vol. 147(3), pages 881-909.
   • Alex Gershkov & Benny Moldovanu, 2010. "Optimal Search, Learning and Implementation," Discussion Paper Series dp543, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
5. Arturo Estrada Rodriguez & Rouba Ibrahim & Dongyuan Zhan, 2025. "On Customer (Dis-)Honesty in Unobservable Queues: The Role of Lying Aversion," Management Science, INFORMS, vol. 71(1), pages 844-860, January.
6. Heidrun C. Hoppe & Benny Moldovanu & Aner Sela, 2009. "The Theory of Assortative Matching Based on Costly Signals," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 76(1), pages 253-281.
   • Hoppe, Heidrun C. & Moldovanu, Benny & Sela, Aner, 2005. "The Theory of Assortative Matching Based on Costly Signals," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 85, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
   • moldovanu, benny & Hoppe-Wewetzer, Heidrun C. & Sela, Aner, 2006. "The Theory of Assortative Matching Based on Costly Signals," CEPR Discussion Papers 5543, Centre for Economic Policy Research.
7. Yeon-Koo Che, 2026. "Dynamic Market Design," Papers 2601.00155, arXiv.org.
8. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
9. Łukasz Kruk, 2026. "Fluid Limits for Longest Job First Queues," Mathematics of Operations Research, INFORMS, vol. 51(2), pages 1227-1252, May.
10. Alex Gershkov & Paul Schweinzer, 2010. "When queueing is better than push and shove," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
    • Gerskov, Alex & Schweinzer, Paul, 2006. "When Queueing is Better than Push and Shove," Bonn Econ Discussion Papers 10/2006, University of Bonn, Bonn Graduate School of Economics (BGSE).
    • Gershkov, Alex & Schweinzer, Paul, 2006. "When queueing is better than push and shove," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 144, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
11. Ryuji Sano, 2015. "A Dynamic Mechanism Design for Scheduling with Different Use Lengths," KIER Working Papers 924, Kyoto University, Institute of Economic Research.
12. Ming Hu & Ruslan Momot & Jianfu Wang, 2022. "Privacy Management in Service Systems," Manufacturing & Service Operations Management, INFORMS, vol. 24(5), pages 2761-2779, September.
13. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
14. Luyi Yang & Laurens Debo & Varun Gupta, 2017. "Trading Time in a Congested Environment," Management Science, INFORMS, vol. 63(7), pages 2377-2395, July.
15. Łukasz Kruk, 2022. "Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits," Annals of Operations Research, Springer, vol. 310(2), pages 411-429, March.
16. Philipp Afèche & Opher Baron & Yoav Kerner, 2013. "Pricing Time-Sensitive Services Based on Realized Performance," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 492-506, July.
17. , & , & ,, 2011. "Revenue maximization in the dynamic knapsack problem," Theoretical Economics, Econometric Society, vol. 6(2), May.
    • Deniz Dizdar & Alex Gershkov & Benny Moldovanu, 2010. "Revenue Maximization in the Dynamic Knapsack Problem," Discussion Paper Series dp544, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
18. Rajat Talak & D. Manjunath & Alexandre Proutiere, 2019. "Strategic arrivals to queues offering priority service," Queueing Systems: Theory and Applications, Springer, vol. 92(1), pages 103-130, June.
19. Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Cowles Foundation Discussion Papers 1757, Cowles Foundation for Research in Economics, Yale University.
    • Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Cowles Foundation Discussion Papers 1757R, Cowles Foundation for Research in Economics, Yale University, revised May 2010.
    • Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000111, David K. Levine.
    • Dirk Bergemann & Maher Said, 2010. "Dynamic Auctions: A Survey," Levine's Working Paper Archive 661465000000000035, David K. Levine.
20. Mihalis G. Markakis & Kalyan Talluri & Dmitrii Tikhonenko, 2023. "Sequential Bidding for Merging in Algorithmic Traffic," Manufacturing & Service Operations Management, INFORMS, vol. 25(1), pages 168-181, January.
21. Moulin, Hervé, 2008. "Proportional scheduling, split-proofness, and merge-proofness," Games and Economic Behavior, Elsevier, vol. 63(2), pages 567-587, July.
22. Hervé Moulin, 2007. "On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 266-283, May.
    • Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
23. Rey, David & Levin, Michael W. & Dixit, Vinayak V., 2021. "Online incentive-compatible mechanisms for traffic intersection auctions," European Journal of Operational Research, Elsevier, vol. 293(1), pages 229-247.
24. Jehiel, Philippe & Moldovanu, Benny, 2005. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 142, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
    • Philippe Jehiel & Benny Moldovanu, 2006. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Levine's Bibliography 122247000000001129, UCLA Department of Economics.
    • Philippe Jehiel & Benny Moldovanu, 2005. "Allocative and Informational Externalities in Auctions and Related Mechanisms," Levine's Bibliography 784828000000000490, UCLA Department of Economics.
    • Jehiel, Philippe & moldovanu, benny, 2006. "Allocative and Informational Externalities in Auctions and Related Mechanisms," CEPR Discussion Papers 5558, Centre for Economic Policy Research.
25. William P. Barnett & Daniel A. Levinthal, 2017. "Special Issue Introduction: Evolutionary Logics of Strategy and Organization," Strategy Science, INFORMS, vol. 2(1), pages 1-1, March.
26. Benny Moldovanu & Alex Gershkov, 2008. "The Trade-off Between Fast Learning and Dynamic Efficiency," 2008 Meeting Papers 348, Society for Economic Dynamics.