IDEAS home Printed from https://ideas.repec.org/p/tiu/tiutis/9b99fc05-9d68-48eb-ae8c-9e7988ae4243.html
   My bibliography  Save this paper

Distributionally robust views on queues and related stochastic models

Author

Listed:
  • van Eekelen, Wouter

    (Tilburg University, School of Economics and Management)

Abstract

No abstract is available for this item.

Suggested Citation

  • van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    • Handle: RePEc:tiu:tiutis:9b99fc05-9d68-48eb-ae8c-9e7988ae4243
    as

    Download full text from publisher

    File URL: https://pure.uvt.nl/ws/portalfiles/portal/83993579/Thesis_Wouter_van_Eekelen.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zhi Chen & Melvyn Sim & Peng Xiong, 2020. "Robust Stochastic Optimization Made Easy with RSOME," Management Science, INFORMS, vol. 66(8), pages 3329-3339, August.
    2. Qingxia Kong & Chung-Yee Lee & Chung-Piaw Teo & Zhichao Zheng, 2013. "Scheduling Arrivals to a Stochastic Service Delivery System Using Copositive Cones," Operations Research, INFORMS, vol. 61(3), pages 711-726, June.
    3. Lau, Hon-Shiang & Hing-Ling Lau, Amy, 1996. "The newsstand problem: A capacitated multiple-product single-period inventory problem," European Journal of Operational Research, Elsevier, vol. 94(1), pages 29-42, October.
    4. Athanassios N. Avramidis & Alexandre Deslauriers & Pierre L'Ecuyer, 2004. "Modeling Daily Arrivals to a Telephone Call Center," Management Science, INFORMS, vol. 50(7), pages 896-908, July.
    5. Heijnen, B., 1990. "Best upper and lower bounds on modified stop loss premiums in case of known range, mode, mean and variance of the original risk," Insurance: Mathematics and Economics, Elsevier, vol. 9(2-3), pages 207-220, September.
    6. Ran Ji & Miguel A. Lejeune, 2021. "Data-Driven Optimization of Reward-Risk Ratio Measures," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1120-1137, July.
    7. Arie Harel, 1990. "Convexity Properties of the Erlang Loss Formula," Operations Research, INFORMS, vol. 38(3), pages 499-505, June.
    8. Mehmet A. Begen & Maurice Queyranne, 2011. "Appointment Scheduling with Discrete Random Durations," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 240-257, May.
    9. Ramandeep S. Randhawa, 2016. "Optimality gap of asymptotically derived prescriptions in queueing systems," Queueing Systems: Theory and Applications, Springer, vol. 83(1), pages 131-155, June.
    10. Karthik Natarajan & Melvyn Sim & Joline Uichanco, 2018. "Asymmetry and Ambiguity in Newsvendor Models," Management Science, INFORMS, vol. 64(7), pages 3146-3167, July.
    11. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    12. Shubhechyya Ghosal & Wolfram Wiesemann, 2020. "The Distributionally Robust Chance-Constrained Vehicle Routing Problem," Operations Research, INFORMS, vol. 68(3), pages 716-732, May.
    13. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    14. Steven Nahmias, 1982. "Perishable Inventory Theory: A Review," Operations Research, INFORMS, vol. 30(4), pages 680-708, August.
    15. Georgia Perakis & Guillaume Roels, 2008. "Regret in the Newsvendor Model with Partial Information," Operations Research, INFORMS, vol. 56(1), pages 188-203, February.
    16. Yanıkoğlu, İhsan & Gorissen, Bram L. & den Hertog, Dick, 2019. "A survey of adjustable robust optimization," European Journal of Operational Research, Elsevier, vol. 277(3), pages 799-813.
    17. De Vylder, F. & Goovaerts, M. J., 1982. "Analytical best upper bounds on stop-loss premiums," Insurance: Mathematics and Economics, Elsevier, vol. 1(3), pages 163-175, July.
    18. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    19. Paul Glasserman, 1997. "Bounds and Asymptotics for Planning Critical Safety Stocks," Operations Research, INFORMS, vol. 45(2), pages 244-257, April.
    20. Edelson, Noel M & Hildebrand, David K, 1975. "Congestion Tolls for Poisson Queuing Processes," Econometrica, Econometric Society, vol. 43(1), pages 81-92, January.
    21. Ying Chen & John J. Hasenbein, 2020. "Knowledge, congestion, and economics: Parameter uncertainty in Naor’s model," Queueing Systems: Theory and Applications, Springer, vol. 96(1), pages 83-99, October.
    22. Linda V. Green & Sergei Savin, 2008. "Reducing Delays for Medical Appointments: A Queueing Approach," Operations Research, INFORMS, vol. 56(6), pages 1526-1538, December.
    23. Adam N. Elmachtoub & Vishal Gupta & Michael L. Hamilton, 2021. "The Value of Personalized Pricing," Management Science, INFORMS, vol. 67(10), pages 6055-6070, October.
    24. John R. Birge & Roger J.-B. Wets, 1987. "Computing Bounds for Stochastic Programming Problems by Means of a Generalized Moment Problem," Mathematics of Operations Research, INFORMS, vol. 12(1), pages 149-162, February.
    25. Guido Kaandorp & Ger Koole, 2007. "Optimal outpatient appointment scheduling," Health Care Management Science, Springer, vol. 10(3), pages 217-229, September.
    26. Ioana Popescu, 2005. "A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 632-657, August.
    27. Mehmet A. Begen & Retsef Levi & Maurice Queyranne, 2012. "Technical Note---A Sampling-Based Approach to Appointment Scheduling," Operations Research, INFORMS, vol. 60(3), pages 675-681, June.
    28. Oldrich A. Vasicek, 1977. "Technical Note—An Inequality for the Variance of Waiting Time under a General Queuing Discipline," Operations Research, INFORMS, vol. 25(5), pages 879-884, October.
    29. Dimitris Bertsimas & Ioana Popescu, 2002. "On the Relation Between Option and Stock Prices: A Convex Optimization Approach," Operations Research, INFORMS, vol. 50(2), pages 358-374, April.
    30. James R. Bradley & Peter W. Glynn, 2002. "Managing Capacity and Inventory Jointly in Manufacturing Systems," Management Science, INFORMS, vol. 48(2), pages 273-288, February.
    31. Qingxia Kong & Shan Li & Nan Liu & Chung-Piaw Teo & Zhenzhen Yan, 2020. "Appointment Scheduling Under Time-Dependent Patient No-Show Behavior," Management Science, INFORMS, vol. 66(8), pages 3480-3500, August.
    32. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2014. "Sequencing Appointments for Service Systems Using Inventory Approximations," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 251-262, May.
    33. S. Ayca Erdogan & Brian Denton, 2013. "Dynamic Appointment Scheduling of a Stochastic Server with Uncertain Demand," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 116-132, February.
    34. Wolfram Wiesemann & Daniel Kuhn & Melvyn Sim, 2014. "Distributionally Robust Convex Optimization," Operations Research, INFORMS, vol. 62(6), pages 1358-1376, December.
    35. Dimitris Bertsimas & Xuan Vinh Doan & Karthik Natarajan & Chung-Piaw Teo, 2010. "Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion," Mathematics of Operations Research, INFORMS, vol. 35(3), pages 580-602, August.
    36. Camilo Mancilla & Robert Storer, 2012. "A sample average approximation approach to stochastic appointment sequencing and scheduling," IISE Transactions, Taylor & Francis Journals, vol. 44(8), pages 655-670.
    37. Richard R. Weber, 1983. "Technical Note—A Note on Waiting Times in Single Server Queues," Operations Research, INFORMS, vol. 31(5), pages 950-951, October.
    38. Ying Chen & John J. Hasenbein, 2017. "Staffing large-scale service systems with distributional uncertainty," Queueing Systems: Theory and Applications, Springer, vol. 87(1), pages 55-79, October.
    39. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    40. NESTEROV, Yurii, 1997. "Structure of non-negative polynomials and optimization problems," LIDAM Discussion Papers CORE 1997049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    41. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    42. Yan Chen & Ward Whitt, 2020. "Algorithms for the upper bound mean waiting time in the GI/GI/1 queue," Queueing Systems: Theory and Applications, Springer, vol. 94(3), pages 327-356, April.
    43. Bram L. Gorissen, 2015. "Robust Fractional Programming," Journal of Optimization Theory and Applications, Springer, vol. 166(2), pages 508-528, August.
    44. Gah-Yi Ban & Cynthia Rudin, 2019. "The Big Data Newsvendor: Practical Insights from Machine Learning," Operations Research, INFORMS, vol. 67(1), pages 90-108, January.
    45. James E. Smith, 1995. "Generalized Chebychev Inequalities: Theory and Applications in Decision Analysis," Operations Research, INFORMS, vol. 43(5), pages 807-825, October.
    46. Rob Kaas & Marc Goovaerts & Jan Dhaene & Michel Denuit, 2008. "Modern Actuarial Risk Theory," Springer Books, Springer, edition 2, number 978-3-540-70998-5, February.
    47. Bert Chen & Shane Henderson, 2001. "Two Issues in Setting Call Centre Staffing Levels," Annals of Operations Research, Springer, vol. 108(1), pages 175-192, November.
    48. Jansen, K. & Haezendonck, J. & Goovaerts, M. J., 1986. "Upper bounds on stop-loss premiums in case of known moments up to the fourth order," Insurance: Mathematics and Economics, Elsevier, vol. 5(4), pages 315-334, October.
    49. Amir Ardestani-Jaafari & Erick Delage, 2016. "Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems," Operations Research, INFORMS, vol. 64(2), pages 474-494, April.
    50. Marshall Fisher & Ananth Raman, 1996. "Reducing the Cost of Demand Uncertainty Through Accurate Response to Early Sales," Operations Research, INFORMS, vol. 44(1), pages 87-99, February.
    51. Keiiti Isii, 1960. "The extrema of probability determined by generalized moments (I) bounded random variables," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 12(2), pages 119-134, June.
    52. Aharon Ben-Tal & Eithan Hochman, 1976. "Stochastic Programs with Incomplete Information," Operations Research, INFORMS, vol. 24(2), pages 336-347, April.
    53. Kristin Fridgeirsdottir & Sam Chiu, 2005. "A Note on Convexity of the Expected Delay Cost in Single-Server Queues," Operations Research, INFORMS, vol. 53(3), pages 568-570, June.
    54. Richard R. Weber, 1980. "Note---On the Marginal Benefit of Adding Servers to G/GI/m Queues," Management Science, INFORMS, vol. 26(9), pages 946-951, September.
    55. Karthik Natarajan & Chung Piaw Teo & Zhichao Zheng, 2011. "Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation," Operations Research, INFORMS, vol. 59(3), pages 713-728, June.
    56. Brian Denton & James Viapiano & Andrea Vogl, 2007. "Optimization of surgery sequencing and scheduling decisions under uncertainty," Health Care Management Science, Springer, vol. 10(1), pages 13-24, February.
    57. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.
    58. Napat Rujeerapaiboon & Daniel Kuhn & Wolfram Wiesemann, 2018. "Chebyshev Inequalities for Products of Random Variables," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 887-918, August.
    59. Jinfeng Yue & Bintong Chen & Min-Chiang Wang, 2006. "Expected Value of Distribution Information for the Newsvendor Problem," Operations Research, INFORMS, vol. 54(6), pages 1128-1136, December.
    60. Joseph Abate & Ward Whitt, 1995. "Numerical Inversion of Laplace Transforms of Probability Distributions," INFORMS Journal on Computing, INFORMS, vol. 7(1), pages 36-43, February.
    61. Refael Hassin & Sharon Mendel, 2008. "Scheduling Arrivals to Queues: A Single-Server Model with No-Shows," Management Science, INFORMS, vol. 54(3), pages 565-572, March.
    62. Alexander Shapiro & Jos Berge, 2002. "Statistical inference of minimum rank factor analysis," Psychometrika, Springer;The Psychometric Society, vol. 67(1), pages 79-94, March.
    63. Vairaktarakis, George L., 2000. "Robust multi-item newsboy models with a budget constraint," International Journal of Production Economics, Elsevier, vol. 66(3), pages 213-226, July.
    64. Abdel-Malek, Layek & Montanari, Roberto & Morales, Libia Cristina, 2004. "Exact, approximate, and generic iterative models for the multi-product Newsboy problem with budget constraint," International Journal of Production Economics, Elsevier, vol. 91(2), pages 189-198, September.
    65. Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
    66. Rachel R. Chen & Lawrence W. Robinson, 2014. "Sequencing and Scheduling Appointments with Potential Call-In Patients," Production and Operations Management, Production and Operations Management Society, vol. 23(9), pages 1522-1538, September.
    67. Kong, Qingxia & Lee, Chung-Yee & Teo, Chung-Piaw & Zheng, Zhichao, 2016. "Appointment sequencing: Why the Smallest-Variance-First rule may not be optimal," European Journal of Operational Research, Elsevier, vol. 255(3), pages 809-821.
    68. Wouter van Eekelen & Dick den Hertog & Johan S.H. van Leeuwaarden, 2022. "MAD Dispersion Measure Makes Extremal Queue Analysis Simple," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1681-1692, May.
    69. Dimitris Bertsimas & Nathan Kallus, 2020. "From Predictive to Prescriptive Analytics," Management Science, INFORMS, vol. 66(3), pages 1025-1044, March.
    70. Ioana Popescu, 2007. "Robust Mean-Covariance Solutions for Stochastic Optimization," Operations Research, INFORMS, vol. 55(1), pages 98-112, February.
    71. Steftcho P. Dokov & David P. Morton, 2005. "Second-Order Lower Bounds on the Expectation of a Convex Function," Mathematics of Operations Research, INFORMS, vol. 30(3), pages 662-677, August.
    72. Steven Nahmias & Charles P. Schmidt, 1984. "An efficient heuristic for the multi‐item newsboy problem with a single constraint," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 31(3), pages 463-474, September.
    73. A. Charnes & W. W. Cooper, 1962. "Programming with linear fractional functionals," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 9(3‐4), pages 181-186, September.
    74. Erick Delage & Yinyu Ye, 2010. "Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems," Operations Research, INFORMS, vol. 58(3), pages 595-612, June.
    75. Serguei Foss & Takis Konstantopoulos & Stan Zachary, 2007. "Discrete and Continuous Time Modulated Random Walks with Heavy-Tailed Increments," Journal of Theoretical Probability, Springer, vol. 20(3), pages 581-612, September.
    76. Sungyong Choi & Andrzej Ruszczyński & Yao Zhao, 2011. "A Multiproduct Risk-Averse Newsvendor with Law-Invariant Coherent Measures of Risk," Operations Research, INFORMS, vol. 59(2), pages 346-364, April.
    77. J. Michael Harrison & Assaf Zeevi, 2005. "A Method for Staffing Large Call Centers Based on Stochastic Fluid Models," Manufacturing & Service Operations Management, INFORMS, vol. 7(1), pages 20-36, September.
    78. P. Patrick Wang, 1993. "Static and dynamic scheduling of customer arrivals to a single‐server system," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 345-360, April.
    79. A. E. Eckberg, 1977. "Sharp Bounds on Laplace-Stieltjes Transforms, with Applications to Various Queueing Problems," Mathematics of Operations Research, INFORMS, vol. 2(2), pages 135-142, May.
    80. Hassin, Refael & Haviv, Moshe & Oz, Binyamin, 2023. "Strategic behavior in queues with arrival rate uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 217-224.
    81. Rockafellar, R. Tyrrell & Uryasev, Stanislav, 2002. "Conditional value-at-risk for general loss distributions," Journal of Banking & Finance, Elsevier, vol. 26(7), pages 1443-1471, July.
    82. Illes, Tibor & Terlaky, Tamas, 2002. "Pivot versus interior point methods: Pros and cons," European Journal of Operational Research, Elsevier, vol. 140(2), pages 170-190, July.
    83. Grani A. Hanasusanto & Vladimir Roitch & Daniel Kuhn & Wolfram Wiesemann, 2017. "Ambiguous Joint Chance Constraints Under Mean and Dispersion Information," Operations Research, INFORMS, vol. 65(3), pages 751-767, June.
    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. Roos, Ernst & Brekelmans, Ruud & van Eekelen, Wouter & den Hertog, Dick & van Leeuwaarden, Johan S.H., 2022. "Tight tail probability bounds for distribution-free decision making," European Journal of Operational Research, Elsevier, vol. 299(3), pages 931-944.
    2. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2015. "Appointment Scheduling with Limited Distributional Information," Management Science, INFORMS, vol. 61(2), pages 316-334, February.
    3. Ahmadi-Javid, Amir & Jalali, Zahra & Klassen, Kenneth J, 2017. "Outpatient appointment systems in healthcare: A review of optimization studies," European Journal of Operational Research, Elsevier, vol. 258(1), pages 3-34.
    4. Mengshi Lu & Zuo‐Jun Max Shen, 2021. "A Review of Robust Operations Management under Model Uncertainty," Production and Operations Management, Production and Operations Management Society, vol. 30(6), pages 1927-1943, June.
    5. Ruiwei Jiang & Siqian Shen & Yiling Zhang, 2017. "Integer Programming Approaches for Appointment Scheduling with Random No-Shows and Service Durations," Operations Research, INFORMS, vol. 65(6), pages 1638-1656, December.
    6. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.
    7. Shenghai Zhou & Yichuan Ding & Woonghee Tim Huh & Guohua Wan, 2021. "Constant Job‐Allowance Policies for Appointment Scheduling: Performance Bounds and Numerical Analysis," Production and Operations Management, Production and Operations Management Society, vol. 30(7), pages 2211-2231, July.
    8. Ho-Yin Mak & Ying Rong & Jiawei Zhang, 2014. "Sequencing Appointments for Service Systems Using Inventory Approximations," Manufacturing & Service Operations Management, INFORMS, vol. 16(2), pages 251-262, May.
    9. Christos Zacharias & Tallys Yunes, 2020. "Multimodularity in the Stochastic Appointment Scheduling Problem with Discrete Arrival Epochs," Management Science, INFORMS, vol. 66(2), pages 744-763, February.
    10. Wu, Xueqi & Zhou, Shenghai, 2022. "Sequencing and scheduling appointments on multiple servers with stochastic service durations and customer arrivals," Omega, Elsevier, vol. 106(C).
    11. Karthik Natarajan & Melvyn Sim & Joline Uichanco, 2018. "Asymmetry and Ambiguity in Newsvendor Models," Management Science, INFORMS, vol. 64(7), pages 3146-3167, July.
    12. Zhi Chen & Weijun Xie, 2021. "Regret in the Newsvendor Model with Demand and Yield Randomness," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4176-4197, November.
    13. Avishai Mandelbaum & Petar Momčilović & Nikolaos Trichakis & Sarah Kadish & Ryan Leib & Craig A. Bunnell, 2020. "Data-Driven Appointment-Scheduling Under Uncertainty: The Case of an Infusion Unit in a Cancer Center," Management Science, INFORMS, vol. 66(1), pages 243-270, January.
    14. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    15. Xuan Wang & Jiawei Zhang, 2015. "Process Flexibility: A Distribution-Free Bound on the Performance of k -Chain," Operations Research, INFORMS, vol. 63(3), pages 555-571, June.
    16. Jin Qi, 2017. "Mitigating Delays and Unfairness in Appointment Systems," Management Science, INFORMS, vol. 63(2), pages 566-583, February.
    17. Postek, Krzysztof & Ben-Tal, A. & den Hertog, Dick & Melenberg, Bertrand, 2015. "Exact Robust Counterparts of Ambiguous Stochastic Constraints Under Mean and Dispersion Information," Other publications TiSEM d718e419-a375-4707-b206-e, Tilburg University, School of Economics and Management.
    18. Arlen Dean & Amirhossein Meisami & Henry Lam & Mark P. Van Oyen & Christopher Stromblad & Nick Kastango, 2022. "Quantile regression forests for individualized surgery scheduling," Health Care Management Science, Springer, vol. 25(4), pages 682-709, December.
    19. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    20. Kuiper, Alex & de Mast, Jeroen & Mandjes, Michel, 2021. "The problem of appointment scheduling in outpatient clinics: A multiple case study of clinical practice," Omega, Elsevier, vol. 98(C).

    More about this item

    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:tiu:tiutis:9b99fc05-9d68-48eb-ae8c-9e7988ae4243. 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: Richard Broekman (email available below). General contact details of provider: https://www.tilburguniversity.edu/about/schools/economics-and-management/ .

    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.