Optimized Dream11 Cricket T20I Team Selection Using Machine Learning and Integer Programming

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract This research proposes an optimized fantasy cricket team selection system for the Dream11 platform using machine learning and Integer Linear Programming (ILP). A novel contextual selection score is developed, incorporating eight match-specific performance factors including recent form, venue history, opposition matchups, pitch conditions, environmental variables, and innings-specific effectiveness. The system demonstrates strong predictive performance using Ridge Regression (R2 = 0.88) and generates teams that show meaningful player overlap with Dream11’s publicly presented lineups in 25 T20I matches. The approach is implemented via a user-friendly Google Colab interface, enabling scenario-specific team generation aligned with Dream11’s constraint requirements. This work contributes to the growing field of sports ana- lytics by offering a reproducible, interpretable, and constraint-valid framework for fantasy team optimization that bridges machine learning prediction with operations research methodologies.This research was conducted as part of the MSc Data Science dissertation at the University of Sussex, UK.
Full text 16,381 characters · extracted from preprint-html · click to expand
Optimized Dream11 Cricket T20I Team Selection Using Machine Learning and Integer Programming | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Optimized Dream11 Cricket T20I Team Selection Using Machine Learning and Integer Programming Yashwanth Ajjilapuram This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-7713554/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract This research proposes an optimized fantasy cricket team selection system for the Dream11 platform using machine learning and Integer Linear Programming (ILP). A novel contextual selection score is developed, incorporating eight match-specific performance factors including recent form, venue history, opposition matchups, pitch conditions, environmental variables, and innings-specific effectiveness. The system demonstrates strong predictive performance using Ridge Regression (R2 = 0.88) and generates teams that show meaningful player overlap with Dream11’s publicly presented lineups in 25 T20I matches. The approach is implemented via a user-friendly Google Colab interface, enabling scenario-specific team generation aligned with Dream11’s constraint requirements. This work contributes to the growing field of sports ana- lytics by offering a reproducible, interpretable, and constraint-valid framework for fantasy team optimization that bridges machine learning prediction with operations research methodologies. This research was conducted as part of the MSc Data Science dissertation at the University of Sussex, UK. Artificial Intelligence and Machine Learning Operations Research Fantasy Sports Analytics Cricket Performance Prediction Machine Learning In- teger Linear Programming Sports Optimization Full Text Additional Declarations The authors declare no competing interests. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-7713554","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":520604372,"identity":"f1098730-2ff6-42d9-87c0-4add65435b05","order_by":0,"name":"Yashwanth Ajjilapuram","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABUklEQVRIie3RsUrDQBwG8EjhsoS6JkQSX0C4Ekhx6WM4Xykky7UEChKwaKdO4ix08BVShM4HB80SzHpShyvFuDhkKjpYvKSFmlidBfMNCXf//PhyiSRVqfI3A/IrlCQEkbfdQ/7AyO6E/0zUDYHbPR7NrJyg38mmK8vBYlRrD/O678/DMEyWyuDpsikT7nHY6sE5fQ4QAO7dGV2IlpZxMiySCDctZZaop9coe7FOHz44NkPKUXcyd6AgHcsmRUIw0DGgqphmpNYOIkkQFXQnY5QR0p6WSPyS6HgtSMwzciWIvGLCuo2xm+4lDNl6dyQIy1uoIIpoQTVk6nhvi8Zebf3jhmoBy1vCvhYp5wyRWSPQsUfE6cpnqcduot2u6CGMsdN48y969UiePr6vB6Y5du/T1G8ZJXK8WyoOLPwImI+gVI65++Yy5QXyZVSlSpUq/zufAOGLqs2U/ukAAAAASUVORK5CYII=","orcid":"https://orcid.org/0009-0000-0198-8303","institution":"University of Sussex","correspondingAuthor":true,"prefix":"","firstName":"Yashwanth","middleName":"","lastName":"Ajjilapuram","suffix":""}],"badges":[],"createdAt":"2025-09-25 13:39:45","currentVersionCode":1,"declarations":{"humanSubjects":false,"vertebrateSubjects":false,"conflictsOfInterestStatement":false,"humanSubjectEthicalGuidelines":false,"humanSubjectConsent":false,"humanSubjectClinicalTrial":false,"humanSubjectCaseReport":false,"vertebrateSubjectEthicalGuidelines":false},"doi":"10.21203/rs.3.rs-7713554/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-7713554/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":92257056,"identity":"14f8b0d8-a5d0-4597-8bfe-d6c9aec3cb08","added_by":"auto","created_at":"2025-09-26 11:41:51","extension":"docx","order_by":0,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":423097,"visible":true,"origin":"","legend":"","description":"","filename":"yashwanthpreprintresearchsquare.docx","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/14548ac646de0c20a169fc58.docx"},{"id":92257046,"identity":"186ef739-f441-4500-aa72-e230d450c6b0","added_by":"auto","created_at":"2025-09-26 11:41:50","extension":"json","order_by":1,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":342,"visible":true,"origin":"","legend":"","description":"","filename":"rs7713554.json","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/0778583b13e3693b83b0e193.json"},{"id":92257049,"identity":"d1cb605f-13ce-496e-a755-bd7c21cacc35","added_by":"auto","created_at":"2025-09-26 11:41:50","extension":"xml","order_by":2,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":29171,"visible":true,"origin":"","legend":"","description":"","filename":"rs77135540enriched.xml","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/9195be79b4884946912cebef.xml"},{"id":92257310,"identity":"73ace877-a67b-438b-b2ee-1461f531913f","added_by":"auto","created_at":"2025-09-26 11:49:50","extension":"eps","order_by":3,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":392,"visible":true,"origin":"","legend":"","description":"","filename":"drawingimage1.eps","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/cc3dd25c085991ce64957abd.eps"},{"id":92257314,"identity":"383b370f-a8d4-49e2-aa0c-c908c6e66235","added_by":"auto","created_at":"2025-09-26 11:49:51","extension":"eps","order_by":4,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":387,"visible":true,"origin":"","legend":"","description":"","filename":"drawingimage2.eps","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/50a1f9ce3d1d5ee457db6049.eps"},{"id":92257051,"identity":"28a56cd0-9d67-4832-abce-02fb392608af","added_by":"auto","created_at":"2025-09-26 11:41:50","extension":"jpeg","order_by":5,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":315284,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage1.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/411bf325bc0faf61c0535ab1.jpeg"},{"id":92257048,"identity":"5e6389ff-02e3-4e05-8a56-ff47ec5cda0d","added_by":"auto","created_at":"2025-09-26 11:41:50","extension":"jpeg","order_by":6,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":1074,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage2.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/057193808c5d770af1be7829.jpeg"},{"id":92257052,"identity":"1d552d5f-be47-403d-be8f-3a7ab5635c6d","added_by":"auto","created_at":"2025-09-26 11:41:51","extension":"jpeg","order_by":7,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":299089,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage3.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/202f4116738775a07098a7f8.jpeg"},{"id":92257312,"identity":"6c11d54c-9308-4476-b355-112c581312fa","added_by":"auto","created_at":"2025-09-26 11:49:51","extension":"jpeg","order_by":8,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":304683,"visible":true,"origin":"","legend":"","description":"","filename":"floatimage4.jpeg","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/15a50aad0527f0182031bf24.jpeg"},{"id":92257311,"identity":"5782348a-5881-4def-87a9-5ae43e3339a5","added_by":"auto","created_at":"2025-09-26 11:49:50","extension":"png","order_by":9,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":75403,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage1.png","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/0d66afe97927bce3b1294fda.png"},{"id":92258161,"identity":"5c042fee-fc5d-4bf3-8e15-91e5d3ac9347","added_by":"auto","created_at":"2025-09-26 11:57:51","extension":"png","order_by":10,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":935,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage2.png","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/8bb4c91896b2e8590f91c5f5.png"},{"id":92257059,"identity":"7f5f1def-4745-42c6-96d7-375c8c21d716","added_by":"auto","created_at":"2025-09-26 11:41:51","extension":"png","order_by":11,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":39388,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage3.png","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/cfd27c12d27c99579a7588bc.png"},{"id":92258162,"identity":"3f2efbe9-82e1-499e-a1d5-3c51024ba181","added_by":"auto","created_at":"2025-09-26 11:57:51","extension":"png","order_by":12,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":80134,"visible":true,"origin":"","legend":"","description":"","filename":"Onlinefloatimage4.png","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/69cf701eda405ee24f7d3751.png"},{"id":92257057,"identity":"6fd213f7-209c-4737-975e-c67a2faead6c","added_by":"auto","created_at":"2025-09-26 11:41:51","extension":"xml","order_by":13,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":27946,"visible":true,"origin":"","legend":"","description":"","filename":"rs77135540structuring.xml","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/d8c2b2eed70c4be031f6bc07.xml"},{"id":92257316,"identity":"e61abdb2-0233-4fea-99b8-cb41c4b0efd6","added_by":"auto","created_at":"2025-09-26 11:49:51","extension":"html","order_by":14,"title":"","display":"","copyAsset":false,"role":"acdc-reference","size":33746,"visible":true,"origin":"","legend":"","description":"","filename":"earlyproof.html","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1/903a32a29ee07d6e37de100c.html"},{"id":92258296,"identity":"9cea0cde-63b2-4761-92e3-00ddc46db553","added_by":"auto","created_at":"2025-09-26 12:05:51","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":649366,"visible":true,"origin":"","legend":"","description":"","filename":"yashwanthpreprintresearchsquare.pdf","url":"https://assets-eu.researchsquare.com/files/rs-7713554/v1_covered_45b9a1a6-85d3-476b-9c32-8eee2859da57.pdf"}],"financialInterests":"The authors declare no competing interests.","formattedTitle":"\u003cp\u003eOptimized Dream11 Cricket T20I Team Selection Using Machine Learning and Integer Programming\u003c/p\u003e","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"University of Sussex","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Fantasy Sports Analytics, Cricket Performance Prediction, Machine Learning, In- teger Linear Programming, Sports Optimization","lastPublishedDoi":"10.21203/rs.3.rs-7713554/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-7713554/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis research proposes an optimized fantasy cricket team selection system for the Dream11 platform using machine learning and Integer Linear Programming (ILP). A novel contextual selection score is developed, incorporating eight match-specific performance factors including recent form, venue history, opposition matchups, pitch conditions, environmental variables, and innings-specific effectiveness. The system demonstrates strong predictive performance using Ridge Regression (R2\u0026thinsp;=\u0026thinsp;0.88) and generates teams that show meaningful player overlap with Dream11\u0026rsquo;s publicly presented lineups in 25 T20I matches. The approach is implemented via a user-friendly Google Colab interface, enabling scenario-specific team generation aligned with Dream11\u0026rsquo;s constraint requirements. This work contributes to the growing field of sports ana- lytics by offering a reproducible, interpretable, and constraint-valid framework for fantasy team optimization that bridges machine learning prediction with operations research methodologies.\u003c/p\u003e\u003cp\u003eThis research was conducted as part of the MSc Data Science dissertation at the University of Sussex, UK.\u003c/p\u003e","manuscriptTitle":"Optimized Dream11 Cricket T20I Team Selection Using Machine Learning and Integer Programming","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-09-26 11:41:46","doi":"10.21203/rs.3.rs-7713554/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"b398396a-6f5a-4c2a-aa08-4b1e44c939ff","owner":[],"postedDate":"September 26th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[{"id":55343288,"name":"Artificial Intelligence and Machine Learning"},{"id":55343289,"name":"Operations Research"}],"tags":[],"updatedAt":"2025-09-26T11:41:46+00:00","versionOfRecord":[],"versionCreatedAt":"2025-09-26 11:41:46","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-7713554","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-7713554","identity":"rs-7713554","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00