{"id":"https://openalex.org/W7129589236","doi":"https://doi.org/10.48550/arxiv.2602.13422","title":"The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods","display_name":"The Complexity of Tournament Fixing: Subset FAS Number and Acyclic Neighborhoods","publication_year":2026,"publication_date":"2026-02-13","ids":{"openalex":"https://openalex.org/W7129589236","doi":"https://doi.org/10.48550/arxiv.2602.13422"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.13422","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126252704","display_name":"Yuxi Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Yuxi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126239454","display_name":"Junqiang Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peng, Junqiang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126264918","display_name":"Mingyu Xiao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiao, Mingyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.2565000057220459,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.2565000057220459,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.2134999930858612,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.10899999737739563,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/tournament","display_name":"Tournament","score":0.8881000280380249},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8646000027656555},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5626000165939331},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.3874000012874603},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3817000091075897},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.3522000014781952}],"concepts":[{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.8881000280380249},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8646000027656555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.612500011920929},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5626000165939331},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5616999864578247},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3540000021457672},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3522000014781952},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2720000147819519},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.2572999894618988}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.13422","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.13422","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.13422","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.13422","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"\\textsc{Tournament":[1],"Fixing":[2],"Problem}":[3],"(TFP)":[4],"asks":[5],"whether":[6,60],"a":[7,16,85],"knockout":[8],"tournament":[9],"can":[10,168],"be":[11,31],"scheduled":[12],"to":[13,30,66],"guarantee":[14],"that":[15,87,107,148],"given":[17],"player":[18],"$v^*$":[19,47,83,118,167],"wins.":[20],"Although":[21],"TFP":[22,61,108,149],"is":[23,28,62,88,119,136,174],"NP-hard":[24,110],"in":[25],"general,":[26],"it":[27,57],"known":[29],"\\emph{fixed-parameter":[32],"tractable}":[33],"(FPT)":[34],"when":[35,112,139,171],"parameterized":[36,152],"by":[37,105,128,153],"the":[38,44,67,74,92,113,125,129,133,154],"feedback":[39],"arc/vertex":[40],"set":[41],"number,":[42],"or":[43,132],"in/out-degree":[45],"of":[46,71,77,117,158],"(AAAI":[48,95],"17;":[49],"IJCAI":[50],"18;":[51],"AAAI":[52,54],"23;":[53],"26).":[55,96],"However,":[56],"remained":[58],"open":[59],"FPT":[63,151],"with":[64],"respect":[65],"\\emph{subset":[68],"FAS":[69,115,156],"number":[70,76,116,157],"$v^*$}":[72],"--":[73,84],"minimum":[75],"arcs":[78],"intersecting":[79],"all":[80],"cycles":[81],"containing":[82],"parameter":[86,173],"never":[89],"larger":[90],"than":[91],"aforementioned":[93],"ones":[94],"In":[97],"this":[98,102,172],"paper,":[99],"we":[100,146,161],"resolve":[101],"question":[103],"negatively":[104],"proving":[106],"stays":[109],"even":[111,170],"subset":[114,155],"constant":[120],"$\\geq":[121],"1$":[122],"and":[123,142],"either":[124],"subgraph":[126],"induced":[127],"in-neighbors":[130],"$D[N_{\\mathrm{in}}(v^*)]$":[131,141],"out-neighbors":[134],"$D[N_{\\mathrm{out}}(v^*)]$":[135,143],"acyclic.":[137],"Conversely,":[138],"both":[140],"are":[144],"acyclic,":[145],"show":[147],"becomes":[150],"$v^*$.":[159],"Furthermore,":[160],"provide":[162],"sufficient":[163],"conditions":[164],"under":[165],"which":[166],"win":[169],"unbounded.":[175]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-18T00:00:00"}