Match-making Engine for toy exchange
- or -
Post a project like this1238
£250(approx. $314)
- Posted:
- Proposals: 13
- Remote
- #3077476
- OPPORTUNITY
- Awarded
Application Architect - Full Stack Developer and Designer - Mobile App Design and Development, Swift, React.js, Node.js, HTML5, Javascript, PHP, MySQL, jQuery, API,
Islington
Top rated PHP Web Development | WordPress | Magento | Drupal | OpenCart | PrestaShop | Joomla
Leicester
♛ TOP Rated ♛ | Website Development | iOS/Android Apps | React Native | Laravel | Flutter | Codeigniter | NodeJS | AngularJS
Ystrad Mynach
PPH TOP Website & App Developer✮LOGO & Graphic Designer✮Content Writer✮Translator
Dubai
Full Stack Developer : PHP| React | Angular | Node.js | IONIC | React Native | Mobile App Development
Shenzhen
25891704392940680242076610507541150194124641318816242274804255683137108864332474
Description
Experience Level: Intermediate
Estimated project duration: less than 1 week
We are trying to create a matchmaking engine, what we can use later for application or platform, where kids can exchange toys. Each week the parents fill in a form, where they give their contact (email), their offer type and their preferences on each type of toys they would be happy to receive in exchange to their offer.
There will be 20 types of toys to offer.
They also give their timezone (and other not relevant details) and availability for the week, so they can arrange some social time between the kids online.
Other details:
They take part in weekly applications.
They receive Succes Points if they are matched up with someone that week, which will affect their position in the queue for the next participation.
Input:
Timezone (so we can adjust the availability times)
Weekly available times
Toy type (about 20 categories)
Toy preference (Mark 1-5 (5 being most preferred) each toy type to get)
How many toys they would like to exchange that week 1-2-3-4?
Some other information, what does not affect the matchmaking
From the system: matchups from history and the last success point carries over to this week.
Sorting
Filter by availability (not timezone!), then
Sort the kids by last success points (0 to the top) then
By activity (how many weeks (how many times) they have taken part)
By registering time of the availability for that week
Matching
Match the given toy to someone who has the highest preference
If matched with preference 5, the giver gets 5 success points (4 for 4, and 3 for 3)
Do not match with 1 or 2 preference point
If no match left gets 0 Success Point - so next week they will get on the top of the matching list
2. If giving matching is successful, they need to get a toy of their highest preference possible.
3. The one who gave a toy already and would like to offer one more, can be put back in the algorithm with the next toy
Output
Get a list of the matches with all inputs from each side (offer and getting), and also the list of kids with unsuccessful matches.
Need to be able to export the data through (API).
Condition: The main point, if they give a toy, they get one in exchange.
If they offer more than one toy, after they have been matched with the first, they “need to queue” again with their second toy.
No kid should give a toy without getting one (with preference point 3-4-5).
Those kids, who did not have a match (have 0 success points) will be on the top of the matching queue next week.
Input platform: Can be a form taking platform (like Google forms), I am open to suggestions, needs to be user friendly, not old school form, or possibility to connect the engine with a nice front. Answers listed in a database form and can be locked if reaches the limit (be able to close the registration for the week)
Success Points shows the latest value they received by the system (not adding up by the time)
There will be 20 types of toys to offer.
They also give their timezone (and other not relevant details) and availability for the week, so they can arrange some social time between the kids online.
Other details:
They take part in weekly applications.
They receive Succes Points if they are matched up with someone that week, which will affect their position in the queue for the next participation.
Input:
Timezone (so we can adjust the availability times)
Weekly available times
Toy type (about 20 categories)
Toy preference (Mark 1-5 (5 being most preferred) each toy type to get)
How many toys they would like to exchange that week 1-2-3-4?
Some other information, what does not affect the matchmaking
From the system: matchups from history and the last success point carries over to this week.
Sorting
Filter by availability (not timezone!), then
Sort the kids by last success points (0 to the top) then
By activity (how many weeks (how many times) they have taken part)
By registering time of the availability for that week
Matching
Match the given toy to someone who has the highest preference
If matched with preference 5, the giver gets 5 success points (4 for 4, and 3 for 3)
Do not match with 1 or 2 preference point
If no match left gets 0 Success Point - so next week they will get on the top of the matching list
2. If giving matching is successful, they need to get a toy of their highest preference possible.
3. The one who gave a toy already and would like to offer one more, can be put back in the algorithm with the next toy
Output
Get a list of the matches with all inputs from each side (offer and getting), and also the list of kids with unsuccessful matches.
Need to be able to export the data through (API).
Condition: The main point, if they give a toy, they get one in exchange.
If they offer more than one toy, after they have been matched with the first, they “need to queue” again with their second toy.
No kid should give a toy without getting one (with preference point 3-4-5).
Those kids, who did not have a match (have 0 success points) will be on the top of the matching queue next week.
Input platform: Can be a form taking platform (like Google forms), I am open to suggestions, needs to be user friendly, not old school form, or possibility to connect the engine with a nice front. Answers listed in a database form and can be locked if reaches the limit (be able to close the registration for the week)
Success Points shows the latest value they received by the system (not adding up by the time)
Ágnes N.
100% (2)Projects Completed
2
Freelancers worked with
2
Projects awarded
29%
Last project
10 Nov 2022
United Kingdom
New Proposal
Login to your account and send a proposal now to get this project.
Log inClarification Board Ask a Question
-
Is that your real budget Ágnes?
958859
We collect cookies to enable the proper functioning and security of our website, and to enhance your experience. By clicking on 'Accept All Cookies', you consent to the use of these cookies. You can change your 'Cookies Settings' at any time. For more information, please read ourCookie Policy
Cookie Settings
Accept All Cookies