{"id":"https://openalex.org/W4416798042","doi":"https://doi.org/10.1109/tg.2025.3635106","title":"Maximizing the Score in \u201c <i>Ticket to Ride</i> \u201d","display_name":"Maximizing the Score in \u201c <i>Ticket to Ride</i> \u201d","publication_year":2025,"publication_date":"2025-11-28","ids":{"openalex":"https://openalex.org/W4416798042","doi":"https://doi.org/10.1109/tg.2025.3635106"},"language":null,"primary_location":{"id":"doi:10.1109/tg.2025.3635106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tg.2025.3635106","pdf_url":null,"source":{"id":"https://openalex.org/S4210224842","display_name":"IEEE Transactions on Games","issn_l":"2475-1502","issn":["2475-1502","2475-1510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Games","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111968327","display_name":"Elizabeth Schaefer","orcid":null},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elizabeth Schaefer","raw_affiliation_strings":["Computer Science Department, Yale University, New Haven, CT, USA"],"raw_orcid":"https://orcid.org/0009-0006-4798-8724","affiliations":[{"raw_affiliation_string":"Computer Science Department, Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120482141","display_name":"Andrew Schaefer","orcid":null},"institutions":[{"id":"https://openalex.org/I74775410","display_name":"Rice University","ror":"https://ror.org/008zs3103","country_code":"US","type":"education","lineage":["https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrew Schaefer","raw_affiliation_strings":["CMOR Department, Rice University, Houston, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-0379-741X","affiliations":[{"raw_affiliation_string":"CMOR Department, Rice University, Houston, TX, USA","institution_ids":["https://openalex.org/I74775410"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44041972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"1","first_page":"229","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.19110000133514404,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.19110000133514404,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.14740000665187836,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.09929999709129333,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ticket","display_name":"Ticket","score":0.7407000064849854},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.6277999877929688},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4438000023365021},{"id":"https://openalex.org/keywords/balance","display_name":"Balance (ability)","score":0.44279998540878296},{"id":"https://openalex.org/keywords/budget-constraint","display_name":"Budget constraint","score":0.3116999864578247},{"id":"https://openalex.org/keywords/variation","display_name":"Variation (astronomy)","score":0.3034999966621399}],"concepts":[{"id":"https://openalex.org/C2776540713","wikidata":"https://www.wikidata.org/wiki/Q7800647","display_name":"Ticket","level":2,"score":0.7407000064849854},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.6277999877929688},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5260000228881836},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4496999979019165},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4438000023365021},{"id":"https://openalex.org/C168031717","wikidata":"https://www.wikidata.org/wiki/Q1530280","display_name":"Balance (ability)","level":2,"score":0.44279998540878296},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.38510000705718994},{"id":"https://openalex.org/C8505890","wikidata":"https://www.wikidata.org/wiki/Q605095","display_name":"Budget constraint","level":2,"score":0.3116999864578247},{"id":"https://openalex.org/C2778334786","wikidata":"https://www.wikidata.org/wiki/Q1586270","display_name":"Variation (astronomy)","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2831999957561493},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C112758219","wikidata":"https://www.wikidata.org/wiki/Q16038819","display_name":"Duration (music)","level":2,"score":0.27410000562667847},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2727000117301941}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tg.2025.3635106","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tg.2025.3635106","pdf_url":null,"source":{"id":"https://openalex.org/S4210224842","display_name":"IEEE Transactions on Games","issn_l":"2475-1502","issn":["2475-1502","2475-1510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Games","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1495472867","https://openalex.org/W2074613642","https://openalex.org/W2750737324","https://openalex.org/W2892327512","https://openalex.org/W3089072703","https://openalex.org/W3193113430","https://openalex.org/W4241768805","https://openalex.org/W4380881469","https://openalex.org/W4408259600"],"related_works":[],"abstract_inverted_index":{"We":[0,98,110],"give":[1],"two":[2],"graph-theoretic":[3],"models":[4],"and":[5,46,64,117],"a":[6,34],"mixed-integer":[7,76],"program":[8],"to":[9,21,25,29,91,106,131,148],"calculate":[10,100],"the":[11,16,41,47,75,81,85,101,112,142,151],"maximum":[12],"achievable":[13],"score":[14,94],"in":[15,140],"popular":[17],"board":[18],"game":[19],"\u201cTicket":[20],"Ride.\u201d":[22],"In":[23,134],"Ticket":[24],"Ride,":[26],"players":[27],"compete":[28],"claim":[30],"railway":[31],"routes":[32,118],"on":[33,40],"map,":[35],"with":[36,84],"points":[37],"awarded":[38],"based":[39],"length":[42],"of":[43,50,95],"each":[44,65],"route":[45,66],"successful":[48],"completion":[49],"destination":[51],"tickets":[52,116],"connecting":[53],"specific":[54],"city":[55],"pairs.":[56],"Each":[57],"player":[58],"has":[59],"45":[60,86],"train":[61,88,108],"cars":[62],"available,":[63],"can":[67,145],"be":[68,129,146],"chosen":[69,115],"by":[70],"only":[71],"one":[72],"player.":[73],"Using":[74],"programming":[77],"model,":[78],"we":[79,136],"examine":[80],"optimal":[82,93,102],"solution":[83],"allocatable":[87],"cars,":[89],"leading":[90],"an":[92],"285":[96],"points.":[97],"also":[99],"solutions":[103],"for":[104],"up":[105],"50":[107,121],"cars.":[109],"determine":[111],"most":[113],"frequently":[114],"over":[119],"these":[120],"instances,":[122],"giving":[123],"insight":[124],"into":[125],"how":[126],"optimization":[127],"might":[128],"used":[130],"balance":[132,150],"games.":[133],"particular,":[135],"identify":[137],"several":[138],"instances":[139],"which":[141],"point":[143],"values":[144],"adjusted":[147],"better":[149],"game.":[152]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-28T00:00:00"}