The DigitalAG Challenge aims to ensure the inclusion of youth and the private sector, and crowd source innovative ICT solutions to raise efficiency of agricultural markets, whilst tackling related issues such as: logistics, food loss and waste, water resource management and environmental degradation.
The competition tracks are
Access to Markets & Services
Access to Finance
The Challenge is organized in three phases:
Phase I: Call for Innovation
Crowdsourcing innovative and tailored ICT solutions which address issues related to:
(i) access to services and markets; (ii) access to finance; (iii) resource management.
Phase II: Coaching and Mentorship
To prepare the shortlisted candidates through a guided mentorship and coaching program, with the aim of making their ideas commercially viable.
Phase III: Selection and Awards
Provide the contestants with an avenue for networking and recognition, and support their concept and prototype development.
Competition Launch: May 9, 2018
1st Phase Shortlisting Announcement: By the 15th of July
Training Program (for shortlisted candidates): During July and August
2nd Phase Shortlisting Announcement: By the 1st of September
Idea Pitching and Award Ceremony: By 15th of September
Stay tuned for more details on exact dates and venues.
The rewards will be tailored to the needs of the winning solutions, and will include incubation, capacity building and training. Some of our partners will be offering seed funds of up to 90,000 EGP per solution!
• Applicants should form teams (a minimum of 2 members). Individual submissions will not be accepted.
• The team has the required technical capabilities and willingness to work on their idea until it reaches the implementation stage.
• The solution uses mobile, broadband, digital and/or information technology, to strengthen agricultural markets in Egypt.
• The solution focuses on at least one of the three tracks identified by this challenge and is tailored and applicable to the Egyptian context.
You will stand a better chance at winning, if your solution is: