{"id":"https://openalex.org/W7127598502","doi":"https://doi.org/10.48550/arxiv.2602.02628","title":"A two-player version of the assignment problem","display_name":"A two-player version of the assignment problem","publication_year":2026,"publication_date":"2026-02-02","ids":{"openalex":"https://openalex.org/W7127598502","doi":"https://doi.org/10.48550/arxiv.2602.02628"},"language":"en","primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.02628","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":null,"license_id":null,"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/A5010982309","display_name":"Florian Galliot","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Galliot, Florian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125076060","display_name":"Nacim Oijid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oijid, Nacim","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027748422","display_name":"Jonas S\u00e9nizergues","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S\u00e9nizergues, Jonas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010982309"],"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/T12288","display_name":"Optimization and Search Problems","score":0.4296000003814697,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.4296000003814697,"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"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.2777000069618225,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.06360000371932983,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/alice","display_name":"Alice (programming language)","score":0.689300000667572},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6775000095367432},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"Assignment problem","score":0.6507999897003174},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6380000114440918},{"id":"https://openalex.org/keywords/weapon-target-assignment-problem","display_name":"Weapon target assignment problem","score":0.6104000210762024},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.6049000024795532},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5419999957084656}],"concepts":[{"id":"https://openalex.org/C2778222013","wikidata":"https://www.wikidata.org/wiki/Q1136926","display_name":"Alice (programming language)","level":2,"score":0.689300000667572},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6775000095367432},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6507999897003174},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6380000114440918},{"id":"https://openalex.org/C30202268","wikidata":"https://www.wikidata.org/wiki/Q7978065","display_name":"Weapon target assignment problem","level":4,"score":0.6104000210762024},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6068999767303467},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.6049000024795532},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5419999957084656},{"id":"https://openalex.org/C127964579","wikidata":"https://www.wikidata.org/wiki/Q649676","display_name":"Alice and Bob","level":3,"score":0.48159998655319214},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3813000023365021},{"id":"https://openalex.org/C165810428","wikidata":"https://www.wikidata.org/wiki/Q6553416","display_name":"Linear bottleneck assignment problem","level":5,"score":0.3562999963760376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33180001378059387},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3285999894142151},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.29190000891685486},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2847999930381775},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2770000100135803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2689000070095062},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.26429998874664307}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.02628","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:HAL:hal-05492254v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05492254","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2026","raw_type":"Preprints, Working Papers, ..."},{"id":"doi:10.48550/arxiv.2602.02628","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.02628","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.02628","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":null,"license_id":null,"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":{"We":[0,150],"introduce":[1],"the":[2,10,50,57,92,95,100,111,138,153,169,173,183,190,195],"competitive":[3],"assignment":[4,12,58],"problem,":[5],"a":[6,15,20],"two-player":[7],"version":[8],"of":[9,17,22,64,94,99,175,192],"well-known":[11],"problem.":[13],"Given":[14],"set":[16,21],"tasks":[18,73],"and":[19,31,47,54,81,126,141,194],"agents":[23,36,42,71,160,176],"with":[24],"different":[25,28],"efficiencies":[26],"for":[27,56,137],"tasks,":[29,193],"Alice":[30,46,107],"Bob":[32,48,114],"take":[33],"turns":[34],"picking":[35],"one":[37,77,84,180],"by":[38,189],"one.":[39],"Once":[40],"all":[41],"have":[43,162],"been":[44],"picked,":[45],"compute":[49],"optimal":[51,196],"values":[52],"$s_A$":[53],"$s_B$":[55],"problem":[59,120,154,184],"on":[60],"their":[61,69],"respective":[62],"sets":[63],"agents,":[65],"i.e.":[66],"they":[67],"assign":[68],"own":[70],"to":[72,90,145,159],"(with":[74],"at":[75,82,109,116,163,178],"most":[76,83,164,179],"agent":[78],"per":[79,86],"task":[80,85],"agent)":[87],"so":[88],"as":[89,105],"maximize":[91],"sum":[93],"efficiencies.":[96,167],"The":[97],"score":[98,197],"game":[101],"is":[102,155],"then":[103,142],"defined":[104],"$s_A-s_B$.":[106],"aims":[108,115],"maximizing":[110],"score,":[112],"while":[113],"minimizing":[117],"it.":[118],"This":[119],"can":[121,198],"model":[122],"drafts":[123],"in":[124,172,186,201],"sports":[125],"card":[127],"games,":[128],"or":[129],"more":[130],"generally":[131],"situations":[132],"where":[133],"two":[134,165,208],"entities":[135],"fight":[136],"same":[139],"resources":[140],"use":[143],"them":[144],"compete":[146],"against":[147],"each":[148],"other.":[149],"show":[151],"that":[152,161],"PSPACE-complete,":[156],"even":[157],"restricted":[158],"nonzero":[166,181],"On":[168],"other":[170],"hand,":[171],"case":[174],"having":[177],"efficiency,":[182],"lies":[185],"XP":[187],"parameterized":[188],"number":[191],"be":[199],"computed":[200],"linear":[202],"time":[203],"when":[204],"there":[205],"are":[206],"only":[207],"tasks.":[209]},"counts_by_year":[],"updated_date":"2026-05-07T13:39:58.223016","created_date":"2026-02-06T00:00:00"}