# SchoalrX Platform Scenario

**URL:** <https://sef.discourse.group/t/schoalrx-platform-scenario/188>\
**Category:** ScholarX\
**Created:** [October 17, 2020, 1:06pm UTC](https://sef.discourse.group/t/schoalrx-platform-scenario/188 "2020-10-17T13:06:56Z")\
**Posts on this page:** 1\
**Showing post:** 4

<div class="post-metadata">

**Author:** ![akshika47](https://yyz2.discourse-cdn.com/free1/user_avatar/sef.discourse.group/akshika47/32/993_2.png) [@akshika47](https://sef.discourse.group/u/akshika47)\
**Post date:** [October 18, 2020, 2:33am UTC](https://sef.discourse.group/t/schoalrx-platform-scenario/188/4 "2020-10-18T02:33:43Z")

</div>

This is a concurrency problem, so I can think of two solutions for the time being.

1. Three-step process:  
`1. Share the student's application with the student's number 1 choice`  
`2. If there are students without a mentor AND mentors without students: Share the application of the student with their second choice mentor, given that the mentors have slots.`  
`3. Repeat step 2 for choice number three for the same conditions.`  
`4. If there are still students without mentors and mentors without students, we can share those applications with the mentors without students.`

2. Old method: We export the DB to a Google Sheet and do the previous filtering method where we personally do the pairing and send the mentors the final list.

---

_[View the full topic](https://sef.discourse.group/t/schoalrx-platform-scenario/188)._
