IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v307y2023i1p392-405.html
   My bibliography  Save this article

Online voluntary mentoring: Optimising the assignment of students and mentors

Author

Listed:
  • Biró, Péter
  • Gyetvai, Márton

Abstract

After the closure of the schools in Hungary from March 2020 due to the pandemic, many students were left at home with no or not enough parental help for studying, and in the meantime some people had more free time and willingness to help others in need during the lockdown. In this paper we describe the optimisation aspects of a joint NGO project for allocating voluntary mentors to students using a web-based coordination mechanism. The goal of the project has been to form optimal pairs and study groups by taking into account the preferences and the constraints of the participants. In this paper, we present the optimisation concept and the integer programming techniques used for solving the allocation problems. Furthermore, we conducted computational simulations on real and generated data to evaluate the performance of this dynamic matching scheme under different parameter settings.

Suggested Citation

  • Biró, Péter & Gyetvai, Márton, 2023. "Online voluntary mentoring: Optimising the assignment of students and mentors," European Journal of Operational Research, Elsevier, vol. 307(1), pages 392-405.
  • Handle: RePEc:eee:ejores:v:307:y:2023:i:1:p:392-405
    DOI: 10.1016/j.ejor.2022.08.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722006518
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2022.08.008?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Tayfun Sönmez & Alvin E. Roth & M. Utku Ünver, 2007. "Efficient Kidney Exchange: Coincidence of Wants in Markets with Compatibility-Based Preferences," American Economic Review, American Economic Association, vol. 97(3), pages 828-851, June.
    2. Augustine Kwanashie & David F. Manlove, 2014. "An Integer Programming Approach to the Hospitals/Residents Problem with Ties," Operations Research Proceedings, in: Dennis Huisman & Ilse Louwerse & Albert P.M. Wagelmans (ed.), Operations Research Proceedings 2013, edition 127, pages 263-269, Springer.
    3. Nikhil Agarwal & Itai Ashlagi & Eduardo Azevedo & Clayton R. Featherstone & Ömer Karaduman, 2019. "Market Failure in Kidney Exchange," American Economic Review, American Economic Association, vol. 109(11), pages 4026-4070, November.
    4. Tommy ANDERSSON & Lars EHLERS & Alessandro MARTINELLO, 2018. "Dynamic Refugee Matching," Cahiers de recherche 22-2018, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    5. Kolos Csaba Ágoston & Péter Biró & Iain McBride, 2016. "Integer programming methods for special college admissions problems," Journal of Combinatorial Optimization, Springer, vol. 32(4), pages 1371-1399, November.
    6. Bloch, Francis & Cantala, David & Gibaja, Damián, 2020. "Matching through institutions," Games and Economic Behavior, Elsevier, vol. 121(C), pages 204-231.
    7. Nikhil Agarwal & Itai Ashlagi & Michael A. Rees & Paulo Somaini & Daniel Waldinger, 2021. "Equilibrium Allocations Under Alternative Waitlist Designs: Evidence From Deceased Donor Kidneys," Econometrica, Econometric Society, vol. 89(1), pages 37-76, January.
    8. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    9. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Jörg & Manlove, David & Pettersson, William, 2019. "Mathematical models for stable matching problems with ties and incomplete lists," European Journal of Operational Research, Elsevier, vol. 277(2), pages 426-441.
    10. Cao, Nguyen Vi & Fragnière, Emmanuel & Gauthier, Jacques-Antoine & Sapin, Marlène & Widmer, Eric D., 2010. "Optimizing the marriage market: An application of the linear assignment model," European Journal of Operational Research, Elsevier, vol. 202(2), pages 547-553, April.
    11. So, Mee Chi & Thomas, Lyn C. & Huang, Bo, 2016. "Lending decisions with limits on capital available: The polygamous marriage problem," European Journal of Operational Research, Elsevier, vol. 249(2), pages 407-416.
    12. Eric Budish & Gérard P. Cachon & Judd B. Kessler & Abraham Othman, 2017. "Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation," Operations Research, INFORMS, vol. 65(2), pages 314-336, April.
    13. Biró, Péter & van de Klundert, Joris & Manlove, David & Pettersson, William & Andersson, Tommy & Burnapp, Lisa & Chromy, Pavel & Delgado, Pablo & Dworczak, Piotr & Haase, Bernadette & Hemke, Aline & J, 2021. "Modelling and optimisation in European Kidney Exchange Programmes," European Journal of Operational Research, Elsevier, vol. 291(2), pages 447-456.
    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. P'eter Bir'o & M'arton Gyetvai, 2021. "Online voluntary mentoring: Optimising the assignment of students and mentors," Papers 2102.06671, arXiv.org.
    2. Klimentova, Xenia & Biró, Péter & Viana, Ana & Costa, Virginia & Pedroso, João Pedro, 2023. "Novel integer programming models for the stable kidney exchange problem," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1391-1407.
    3. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    4. Ágoston, Kolos Csaba & Biró, Péter & Kováts, Endre & Jankó, Zsuzsanna, 2022. "College admissions with ties and common quotas: Integer programming approach," European Journal of Operational Research, Elsevier, vol. 299(2), pages 722-734.
    5. Ágoston, Kolos Csaba & Biró, Péter & Szántó, Richárd, 2018. "Stable project allocation under distributional constraints," Operations Research Perspectives, Elsevier, vol. 5(C), pages 59-68.
    6. Haris Aziz & Anton Baychkov & Peter Biro, 2021. "Cutoff stability under distributional constraints with an application to summer internship matching," Papers 2102.02931, arXiv.org, revised Oct 2023.
    7. Kastoryano, Stephen, 2024. "Biological, Behavioural and Spurious Selection on the Kidney Transplant Waitlist," IZA Discussion Papers 16995, Institute of Labor Economics (IZA).
    8. Li, Mengling & Riyanto, Yohanes E. & Xu, Menghan, 2023. "Prioritized organ allocation rules under compatibility constraints," Games and Economic Behavior, Elsevier, vol. 141(C), pages 403-427.
    9. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    10. Haluk Ergin & Tayfun Sönmez & M. Utku Ünver, 2020. "Efficient and Incentive‐Compatible Liver Exchange," Econometrica, Econometric Society, vol. 88(3), pages 965-1005, May.
    11. Cheng, Yao & Yang, Zaifu, 2021. "Efficient Kidney Exchange with Dichotomous Preferences," Journal of Health Economics, Elsevier, vol. 80(C).
    12. Nikhil Agarwal & Eric Budish, 2021. "Market Design," NBER Working Papers 29367, National Bureau of Economic Research, Inc.
    13. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).
    14. Klimentova, Xenia & Viana, Ana & Pedroso, João Pedro & Santos, Nicolau, 2021. "Fairness models for multi-agent kidney exchange programmes," Omega, Elsevier, vol. 102(C).
    15. Li, Mengling & Riyanto, Yohanes E. & Xu, Menghan, 2022. "Remedying adverse selection in donor-priority rule using freeze period: Theory and experiment," Journal of Economic Behavior & Organization, Elsevier, vol. 194(C), pages 384-407.
    16. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Jörg & Manlove, David & Pettersson, William, 2019. "Mathematical models for stable matching problems with ties and incomplete lists," European Journal of Operational Research, Elsevier, vol. 277(2), pages 426-441.
    17. Tiago Monteiro & Xenia Klimentova & João Pedro Pedroso & Ana Viana, 2021. "A comparison of matching algorithms for kidney exchange programs addressing waiting time," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(2), pages 539-552, June.
    18. Heo, Eun Jeong & Hong, Sunghoon & Chun, Youngsub, 2022. "Efficient use of immunosuppressants for kidney transplants," Journal of Health Economics, Elsevier, vol. 85(C).
    19. Perach, Nitsan & Anily, Shoshana, 2022. "Stable matching of student-groups to dormitories," European Journal of Operational Research, Elsevier, vol. 302(1), pages 50-61.
    20. Carvalho, Margarida & Lodi, Andrea, 2023. "A theoretical and computational equilibria analysis of a multi-player kidney exchange program," European Journal of Operational Research, Elsevier, vol. 305(1), pages 373-385.

    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:eee:ejores:v:307:y:2023:i:1:p:392-405. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.