{"id":"https://openalex.org/W7131421285","doi":"https://doi.org/10.4230/lipics.stacs.2026.40","title":"Maker-Maker Games of Rank 4 Are PSPACE-Complete","display_name":"Maker-Maker Games of Rank 4 Are PSPACE-Complete","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7131421285","doi":"https://doi.org/10.4230/lipics.stacs.2026.40"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25529","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.40/LIPIcs.STACS.2026.40.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.40/LIPIcs.STACS.2026.40.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Galliot, Florian","orcid":"https://orcid.org/0000-0003-4244-7794"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Galliot, Florian","raw_affiliation_strings":["Aix-Marseille Universit\u00e9, CNRS, I2M, UMR 7373, 13453 Marseille, France"],"raw_orcid":"https://orcid.org/0000-0003-4244-7794","affiliations":[{"raw_affiliation_string":"Aix-Marseille Universit\u00e9, CNRS, I2M, UMR 7373, 13453 Marseille, France","institution_ids":[]}]},{"author_position":"last","author":{"id":null,"display_name":"S\u00e9nizergues, Jonas","orcid":"https://orcid.org/0000-0002-8609-5156"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S\u00e9nizergues, Jonas","raw_affiliation_strings":["Universit\u00e9 de Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France"],"raw_orcid":"https://orcid.org/0000-0002-8609-5156","affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Bordeaux, CNRS, Bordeaux INP, LaBRI, UMR 5800, F-33400 Talence, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.44241049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.2506999969482422,"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.2506999969482422,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.24690000712871552,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.20350000262260437,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7013999819755554},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.644599974155426},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6248000264167786},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5669999718666077},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.5634999871253967}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7087000012397766},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7013999819755554},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.644599974155426},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6248000264167786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.618399977684021},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5669999718666077},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5634999871253967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3693999946117401},{"id":"https://openalex.org/C2780608745","wikidata":"https://www.wikidata.org/wiki/Q367293","display_name":"Convention","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.2612000107765198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2565000057220459}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:25529","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.40/LIPIcs.STACS.2026.40.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.stacs.2026.40","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2026.40","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:25529","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2026.40","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol364-stacs2026/LIPIcs.STACS.2026.40/LIPIcs.STACS.2026.40.pdf","source":{"id":"https://openalex.org/S4306402524","display_name":"Leibniz-Zentrum f\u00fcr Informatik (Schloss Dagstuhl)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7131421285.pdf","grobid_xml":"https://content.openalex.org/works/W7131421285.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,136],"Maker-Maker":[1,145],"convention":[2,88,146],"of":[3,36,71,123,133,140],"positional":[4,83],"games":[5],"is":[6,57,117],"played":[7],"on":[8],"a":[9,23,45,50,85,110,149],"hypergraph":[10],"whose":[11],"edges":[12,122,132],"are":[13],"interpreted":[14],"as":[15,113,148],"winning":[16,96,111],"sets.":[17],"Two":[18],"players":[19],"take":[20],"turns":[21],"picking":[22],"previously":[24],"unpicked":[25],"vertex,":[26],"aiming":[27],"at":[28],"being":[29],"first":[30,46,115],"to":[31,44,59],"pick":[32],"all":[33],"the":[34,55,79,106,114,144],"vertices":[35],"some":[37],"edge.":[38],"Optimal":[39],"play":[40],"can":[41],"only":[42],"lead":[43],"player":[47,92,108,116],"win":[48],"or":[49,126],"draw,":[51],"and":[52,99,128],"deciding":[53,104],"between":[54],"two":[56],"known":[58],"be":[60],"PSPACE-complete":[61,118],"even":[62,119],"for":[63,69,138],"6-uniform":[64],"hypergraphs.":[65],"We":[66,101],"establish":[67],"PSPACE-completeness":[68],"hypergraphs":[70,139],"rank":[72,141],"4.":[73],"As":[74],"an":[75],"intermediary,":[76],"we":[77],"use":[78],"recently":[80],"introduced":[81],"achievement":[82],"games,":[84],"more":[86],"general":[87],"in":[89,143],"which":[90],"each":[91],"has":[93,109],"their":[94],"own":[95],"sets":[97],"(blue":[98],"red).":[100],"show":[102],"that":[103],"whether":[105],"blue":[107,121],"strategy":[112],"with":[120],"size":[124,134],"2":[125],"3":[127],"pairwise":[129],"disjoint":[130],"red":[131],"2.":[135],"result":[137],"4":[142],"follows":[147],"simple":[150],"corollary.":[151]},"counts_by_year":[],"updated_date":"2026-02-10T06:17:13.238206","created_date":"2025-10-10T00:00:00"}