IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2102.06671.html
   My bibliography  Save this paper

Online voluntary mentoring: Optimising the assignment of students and mentors

Author

Listed:
  • P'eter Bir'o
  • M'arton Gyetvai

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 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 computation simulations on real and generated data for evaluate the performance of this dynamic matching scheme under different parameter settings.

Suggested Citation

  • P'eter Bir'o & M'arton Gyetvai, 2021. "Online voluntary mentoring: Optimising the assignment of students and mentors," Papers 2102.06671, arXiv.org.
    • Handle: RePEc:arx:papers:2102.06671
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2102.06671
    File Function: Latest version
    Download Restriction: no
    ---><---

    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. Narges Ahani & Tommy Andersson & Alessandro Martinello & Alexander Teytelboym & Andrew C. Trapp, 2021. "Placement Optimization in Refugee Resettlement," Operations Research, INFORMS, vol. 69(5), pages 1468-1486, September.
    5. 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.
    6. ANDERSSON, Tommy & EHLERS, Lars & MARTINELLO, Alessandro, 2018. "Dynamic refugee matching," Cahiers de recherche 2018-16, Universite de Montreal, Departement de sciences economiques.
    7. 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.
    8. Nikhil Agarwal & Itai Ashlagi & Michael A. Rees & Paulo J. Somaini & Daniel C. Waldinger, 2019. "Equilibrium Allocations under Alternative Waitlist Designs: Evidence from Deceased Donor Kidneys," NBER Working Papers 25607, National Bureau of Economic Research, Inc.
    9. 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.
    10. Kolos Csaba Agoston & Peter Biro & Iain McBride, 2016. "Integer programming methods for special college admissions problems," CERS-IE WORKING PAPERS 1632, Institute of Economics, Centre for Economic and Regional Studies.
    11. Bloch, Francis & Cantala, David & Gibaja, Damián, 2020. "Matching through institutions," Games and Economic Behavior, Elsevier, vol. 121(C), pages 204-231.
    12. 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.
    13. 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.
    14. Á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.
    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. 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.
    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. Á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.
    4. 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.
    5. 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.
    6. 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.
    7. Á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.
    8. Pitchaya Wiratchotisatian & Hoda Atef Yekta & Andrew C. Trapp, 2022. "Stability Representations of Many-to-One Matching Problems: An Integer Optimization Approach," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3325-3343, November.
    9. 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.
    10. Kastoryano, Stephen, 2024. "Biological, Behavioural and Spurious Selection on the Kidney Transplant Waitlist," IZA Discussion Papers 16995, Institute of Labor Economics (IZA).
    11. Csató, László & Tóth, Csaba, 2020. "University rankings from the revealed preferences of the applicants," European Journal of Operational Research, Elsevier, vol. 286(1), pages 309-320.
    12. 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.
    13. 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.
    14. Cheng, Yao & Yang, Zaifu, 2021. "Efficient Kidney Exchange with Dichotomous Preferences," Journal of Health Economics, Elsevier, vol. 80(C).
    15. Kolos Csaba Agoston & Peter Biro & Iain McBride, 2016. "Integer programming methods for special college admissions problems," CERS-IE WORKING PAPERS 1632, Institute of Economics, Centre for Economic and Regional Studies.
    16. Tuan Le & Jon M. Stauffer & Bala Shetty & Chelliah Sriskandarajah, 2023. "An optimization framework for analyzing dual‐donor organ exchange," Production and Operations Management, Production and Operations Management Society, vol. 32(3), pages 740-761, March.
    17. Klimentova, Xenia & Viana, Ana & Pedroso, João Pedro & Santos, Nicolau, 2021. "Fairness models for multi-agent kidney exchange programmes," Omega, Elsevier, vol. 102(C).
    18. Delorme, Maxence & García, Sergio & Gondzio, Jacek & Kalcsics, Joerg & Manlove, David & Pettersson, William, 2021. "Stability in the hospitals/residents problem with couples and ties: Mathematical models and computational studies," Omega, Elsevier, vol. 103(C).
    19. 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.
    20. 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.

    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:arx:papers:2102.06671. 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: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    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.