{"id":"https://openalex.org/W2150132485","doi":"https://doi.org/10.1145/1250910.1250934","title":"On the complexity of combinatorial auctions","display_name":"On the complexity of combinatorial auctions","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2150132485","doi":"https://doi.org/10.1145/1250910.1250934","mag":"2150132485"},"language":"en","primary_location":{"id":"doi:10.1145/1250910.1250934","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250910.1250934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th ACM conference on Electronic commerce","raw_type":"proceedings-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/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I4210146410","display_name":"Science Oxford","ror":"https://ror.org/04j8yhy50","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210146410"]},{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["Oxford University, Oxford, Gt Britain"],"affiliations":[{"raw_affiliation_string":"Oxford University, Oxford, Gt Britain","institution_ids":["https://openalex.org/I4210146410","https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087340443","display_name":"Gianluigi Greco","orcid":"https://orcid.org/0000-0002-5799-6828"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gianluigi Greco","raw_affiliation_strings":["University of Calabria, Cosenza, Italy"],"affiliations":[{"raw_affiliation_string":"University of Calabria, Cosenza, Italy","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050151740"],"corresponding_institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210146410"],"apc_list":null,"apc_paid":null,"fwci":4.1841,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.94081848,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"152","last_page":"161"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9793999791145325,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9682999849319458,"subfield":{"id":"https://openalex.org/subfields/1406","display_name":"Marketing"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.8863993883132935},{"id":"https://openalex.org/keywords/hyperbolic-tree","display_name":"Hyperbolic tree","score":0.6175310611724854},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.580767035484314},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5536615252494812},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5467469096183777},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.5136613249778748},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.473137766122818},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4656539559364319},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46069902181625366},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.45559951663017273},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4483621120452881},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42242786288261414},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36029624938964844},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3270780146121979},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.28763747215270996},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.22392913699150085},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.21825337409973145},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14162886142730713}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8863993883132935},{"id":"https://openalex.org/C97654310","wikidata":"https://www.wikidata.org/wiki/Q574023","display_name":"Hyperbolic tree","level":4,"score":0.6175310611724854},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.580767035484314},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5536615252494812},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5467469096183777},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.5136613249778748},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.473137766122818},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4656539559364319},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46069902181625366},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.45559951663017273},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4483621120452881},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42242786288261414},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36029624938964844},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3270780146121979},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.28763747215270996},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.22392913699150085},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.21825337409973145},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14162886142730713},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C70984080","wikidata":"https://www.wikidata.org/wiki/Q2619102","display_name":"Hyperbolic manifold","level":3,"score":0.0},{"id":"https://openalex.org/C92047909","wikidata":"https://www.wikidata.org/wiki/Q204034","display_name":"Hyperbolic function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1250910.1250934","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250910.1250934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th ACM conference on Electronic commerce","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320006","display_name":"Royal Society","ror":"https://ror.org/03wnrjx87"},{"id":"https://openalex.org/F4320320769","display_name":"Indian Council of Agricultural Research","ror":"https://ror.org/04fw54a43"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W179577048","https://openalex.org/W188850785","https://openalex.org/W1506378440","https://openalex.org/W1543455987","https://openalex.org/W1965686263","https://openalex.org/W2008536061","https://openalex.org/W2013469527","https://openalex.org/W2021348471","https://openalex.org/W2027302359","https://openalex.org/W2029448190","https://openalex.org/W2033325972","https://openalex.org/W2041215952","https://openalex.org/W2055943083","https://openalex.org/W2057556050","https://openalex.org/W2062830639","https://openalex.org/W2076064295","https://openalex.org/W2082691840","https://openalex.org/W2132750992","https://openalex.org/W2137004940","https://openalex.org/W2138098891","https://openalex.org/W2140353857","https://openalex.org/W2142982208","https://openalex.org/W2163675995","https://openalex.org/W2628596753","https://openalex.org/W3191263300","https://openalex.org/W6630400633","https://openalex.org/W6680536132"],"related_works":["https://openalex.org/W1836127928","https://openalex.org/W2480025839","https://openalex.org/W2027388354","https://openalex.org/W1490290385","https://openalex.org/W1572255008","https://openalex.org/W1576158606","https://openalex.org/W1539278744","https://openalex.org/W2084535634","https://openalex.org/W2584271047","https://openalex.org/W2150132485"],"abstract_inverted_index":{"The":[0],"winner":[1,214],"determination":[2,215],"problem":[3,9,31,146,216],"in":[4,33,42,69,85,219],"combinatorial":[5,102,185],"auctions":[6],"is":[7,32,37,63,157,217],"the":[8,12,15,18,22,25,82,106,111,115,150,190,213,243,256],"of":[10,14,24,117,124,152,173,184,192,199,245,251,258],"determining":[11,118],"allocation":[13],"items":[16,83],"among":[17],"bidders":[19],"that":[20,78,92,149,176,189,212,242],"maximizes":[21],"sum":[23],"accepted":[26],"bid":[27],"prices.":[28],"While":[29],"this":[30,141,145,166],"general":[34],"NP-hard,":[35],"it":[36,86],"known":[38],"to":[39,180,204],"be":[40,97,178,205,228],"feasible":[41],"polynomial":[43,220],"time":[44,221],"on":[45,105,222],"those":[46],"instances":[47,223,247,259],"whose":[48,66,224],"associated":[49,98],"item":[50,57,61,94,122,155,263],"graphs":[51,95],"have":[52],"bounded":[53,234],"treewidth":[54,127,162],"(called":[55],"structured":[56,121,154,262],"graphs).":[58],"Formally,":[59],"an":[60],"graph":[62,65,123,156],"a":[64,88,100,120,125,137,153,195,261],"nodes":[67],"are":[68,76],"one-to-one":[70],"correspondence":[71],"with":[72,99,230],"items,":[73],"and":[74],"edges":[75,107],"such":[77],"for":[79,109,161],"any":[80],"bid,":[81],"occurring":[84],"induce":[87],"connected":[89],"subgraph.":[90],"Note":[91],"many":[93],"might":[96],"given":[101],"auction,":[103],"depending":[104],"selected":[108],"guaranteeing":[110],"connectedness.":[112],"In":[113],"fact,":[114],"tractability":[116],"whether":[119],"fixed":[126],"exists":[128],"(and":[129],"if":[130],"so,":[131],"computing":[132],"one)":[133],"was":[134],"left":[135],"as":[136],"crucial":[138],"open":[139],"problem.In":[140],"paper,":[142],"we":[143,169,210,240],"solve":[144],"by":[147,165,249],"proving":[148],"existence":[151],"computationally":[158],"intractable,":[159],"even":[160],"3.":[163],"Motivated":[164],"bad":[167],"news,":[168],"investigate":[170],"different":[171],"kinds":[172],"structural":[174],"requirements":[175],"can":[177,227],"used":[179],"isolate":[181],"tractable":[182,246],"classes":[183],"auctions.":[186],"We":[187],"show":[188,211,241],"notion":[191],"hypertree":[193,235],"decomposition,":[194],"recently":[196],"introduced":[197],"measure":[198],"hypergraph":[200],"cyclicity,":[201],"turns":[202],"out":[203],"most":[206],"useful":[207],"here.":[208],"Indeed,":[209],"solvable":[218],"bidder":[225],"interactions":[226],"represented":[229],"(dual)":[231],"hypergraphs":[232],"having":[233,260],"width.":[236],"Even":[237],"more":[238],"surprisingly,":[239],"class":[244,257],"identified":[248],"means":[250],"our":[252],"approach":[253],"properly":[254],"contains":[255],"graph.":[264]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}