{"id":"https://openalex.org/W7139934164","doi":"https://doi.org/10.48550/arxiv.2603.18668","title":"Complexity of Auctions with Interdependence","display_name":"Complexity of Auctions with Interdependence","publication_year":2026,"publication_date":"2026-03-19","ids":{"openalex":"https://openalex.org/W7139934164","doi":"https://doi.org/10.48550/arxiv.2603.18668"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.18668","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18668","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"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":"https://doi.org/10.48550/arxiv.2603.18668","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077502412","display_name":"Patrick Loiseau","orcid":"https://orcid.org/0000-0003-0674-3369"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Loiseau, Patrick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032045666","display_name":"Simon Mauras","orcid":"https://orcid.org/0000-0003-4080-3118"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mauras, Simon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5130252563","display_name":"Minrui Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Minrui","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/T11182","display_name":"Auction Theory and Applications","score":0.9933000206947327,"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"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9933000206947327,"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/T11031","display_name":"Game Theory and Applications","score":0.001500000013038516,"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/T10991","display_name":"Game Theory and Voting Systems","score":0.0008999999845400453,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.6568999886512756},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.6344000101089478},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.6331999897956848},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5285999774932861},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.5113999843597412},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.4724999964237213},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.46709999442100525},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.46560001373291016},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.36230000853538513}],"concepts":[{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.6568999886512756},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.6344000101089478},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6331999897956848},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5285999774932861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5127999782562256},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.5113999843597412},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5105000138282776},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.4724999964237213},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4706000089645386},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.46709999442100525},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.46560001373291016},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.36230000853538513},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.357699990272522},{"id":"https://openalex.org/C11276805","wikidata":"https://www.wikidata.org/wiki/Q771334","display_name":"Auction theory","level":3,"score":0.35679998993873596},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.34049999713897705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3377000093460083},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31470000743865967},{"id":"https://openalex.org/C123650614","wikidata":"https://www.wikidata.org/wiki/Q282491","display_name":"Strategic dominance","level":2,"score":0.29330000281333923},{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.28999999165534973},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C147220207","wikidata":"https://www.wikidata.org/wiki/Q773073","display_name":"Vickrey\u2013Clarke\u2013Groves auction","level":4,"score":0.2888000011444092},{"id":"https://openalex.org/C74979957","wikidata":"https://www.wikidata.org/wiki/Q4819604","display_name":"Auction algorithm","level":5,"score":0.2883000075817108},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.27000001072883606},{"id":"https://openalex.org/C201650216","wikidata":"https://www.wikidata.org/wiki/Q829492","display_name":"Procurement","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.18668","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18668","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.18668","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.18668","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"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,128,153],"study":[1,87],"auction":[2],"design":[3],"in":[4,61,105],"the":[5,23,26,37,46,50,58,73,88,94,106,117,121,162,172,175],"celebrated":[6],"interdependence":[7],"model":[8],"introduced":[9],"by":[10,49],"Milgrom":[11],"and":[12,79,103,108,120,147,151,170],"Weber":[13],"[1982],":[14],"where":[15],"a":[16,20,43],"mechanism":[17],"designer":[18],"allocates":[19,42],"good,":[21],"maximizing":[22],"value":[24,74,102,126],"of":[25,57,92,97,174],"agent":[27,51],"who":[28],"receives":[29],"it,":[30],"while":[31],"inducing":[32],"truthfulness":[33],"using":[34],"payments.":[35],"In":[36,83],"lesser-studied":[38],"procurement":[39],"auctions,":[40],"one":[41],"chore,":[44],"minimizing":[45],"cost":[47],"incurred":[48],"selected":[52],"to":[53,143],"perform":[54],"it.":[55],"Most":[56],"past":[59],"literature":[60],"theoretical":[62,130],"computer":[63],"science":[64],"considers":[65],"designing":[66],"truthful":[67,98],"mechanisms":[68],"with":[69,76,158],"constant":[70],"approximation":[71,95],"for":[72,100,132,161],"setting,":[75],"restricted":[77],"domains":[78],"monotone":[80],"valuation":[81],"functions.":[82,127],"this":[84],"work,":[85],"we":[86,115],"general":[89,163,176],"computational":[90],"problems":[91],"optimizing":[93],"ratio":[96],"mechanism,":[99],"both":[101],"cost,":[104],"deterministic":[107],"randomized":[109],"settings.":[110],"Unlike":[111],"most":[112],"previous":[113],"works,":[114],"remove":[116],"domain":[118],"restriction":[119],"monotonicity":[122],"assumption":[123],"imposed":[124],"on":[125],"provide":[129],"explanations":[131],"why":[133],"some":[134],"previously":[135],"considered":[136],"special":[137],"cases":[138],"are":[139],"tractable,":[140],"reducing":[141],"them":[142],"classical":[144],"combinatorial":[145],"problems,":[146],"providing":[148,165],"efficient":[149],"algorithms":[150],"characterizations.":[152],"complement":[154],"our":[155],"positive":[156],"results":[157,160],"hardness":[159],"case,":[164],"query":[166],"complexity":[167],"lower":[168],"bounds,":[169],"proving":[171],"NP-Hardness":[173],"case.":[177]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-21T00:00:00"}