{"id":"https://openalex.org/W2035337032","doi":"https://doi.org/10.5555/1109557.1109675","title":"An improved approximation algorithm for combinatorial auctions with submodular bidders","display_name":"An improved approximation algorithm for combinatorial auctions with submodular bidders","publication_year":2006,"publication_date":"2006-01-22","ids":{"openalex":"https://openalex.org/W2035337032","doi":"https://doi.org/10.5555/1109557.1109675","mag":"2035337032"},"language":"en","primary_location":{"id":"mag:2035337032","doi":"https://doi.org/10.5555/1109557.1109675","is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?doid=1109557.1109675","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"volume":null,"type":"conference-paper","indexed_in":[],"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/A5020176884","display_name":"Shahar Dobzinski","orcid":"https://orcid.org/0000-0003-1935-5808","observed_orcids":["https://orcid.org/0000-0003-1935-5808"]},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shahar Dobzinski","raw_affiliation_strings":["The Hebrew University of Jerusalem, , Israel"],"raw_orcid":"https://orcid.org/0000-0003-1935-5808","affiliations":[{"raw_affiliation_string":"The Hebrew University of Jerusalem, , Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027593733","display_name":"Michael Schapira","orcid":"https://orcid.org/0000-0002-9336-8351","observed_orcids":["https://orcid.org/0000-0002-9336-8351"]},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Schapira","raw_affiliation_strings":["The Hebrew University of Jerusalem, , Israel"],"raw_orcid":"https://orcid.org/0000-0002-9336-8351","affiliations":[{"raw_affiliation_string":"The Hebrew University of Jerusalem, , Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I197251160"],"apc_list":null,"apc_paid":null,"fwci":16.0952,"has_fulltext":false,"cited_by_count":153,"citation_normalized_percentile":{"value":0.99334298,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1064","last_page":"1073"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9833999872207642,"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.9833999872207642,"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.0066999997943639755,"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.004600000102072954,"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/combinatorial-auctions","display_name":"combinatorial auctions","score":1.0},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.9599999785423279},{"id":"https://openalex.org/keywords/allocation-problems","display_name":"allocation problems","score":0.5929999947547913},{"id":"https://openalex.org/keywords/communication-complexity-lower-bounds","display_name":"communication complexity lower bounds","score":0.7289999723434448},{"id":"https://openalex.org/keywords/coverage-problem","display_name":"covering problems","score":0.8360000252723694},{"id":"https://openalex.org/keywords/online-algorithms","display_name":"online algorithms","score":0.6959999799728394},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9010000228881836}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9734106063842773},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.780719518661499},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6533772945404053},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5761567950248718},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5518105626106262},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5487332344055176},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.544335663318634},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.49206870794296265},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46654224395751953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4644226133823395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4433208107948303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37967684864997864},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10898816585540771},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2035337032","doi":"https://doi.org/10.5555/1109557.1109675","is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?doid=1109557.1109675","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W88459763","https://openalex.org/W1482405521","https://openalex.org/W1498671329","https://openalex.org/W1530717015","https://openalex.org/W1569146567","https://openalex.org/W1579522749","https://openalex.org/W1594147293","https://openalex.org/W1769120835","https://openalex.org/W1991173480","https://openalex.org/W1991578470","https://openalex.org/W1994408974","https://openalex.org/W1995275762","https://openalex.org/W2004045061","https://openalex.org/W2012554042","https://openalex.org/W2035575256","https://openalex.org/W2064379477","https://openalex.org/W2126085282","https://openalex.org/W2128059732","https://openalex.org/W2143996311","https://openalex.org/W2161272173","https://openalex.org/W2162656786","https://openalex.org/W2164943659","https://openalex.org/W2170193147","https://openalex.org/W3123380468"],"related_works":["https://openalex.org/W2126085282","https://openalex.org/W7027508096","https://openalex.org/W7097785468","https://openalex.org/W2989427540","https://openalex.org/W2357522405","https://openalex.org/W2114365790","https://openalex.org/W1579522749","https://openalex.org/W2951660602","https://openalex.org/W2950006664","https://openalex.org/W118362250"],"abstract_inverted_index":{"We":[0,11],"explore":[1],"the":[2,25,40,46,52,58,83,87],"allocation":[3],"problem":[4],"in":[5,39,82],"combinatorial":[6,94,104],"auctions":[7,95],"with":[8,96],"submodular":[9,79,99],"bidders.":[10,31],"provide":[12],"an":[13,72],"e/e-1":[14],"approximation":[15,73],"algorithm":[16,22,55,69],"for":[17,51,78],"this":[18],"problem.":[19],"Moreover,":[20],"our":[21],"applies":[23],"to":[24],"more":[26],"general":[27],"class":[28],"of":[29],"XOS":[30,53,97],"By":[32],"presenting":[33],"a":[34],"matching":[35],"unconditional":[36],"lower":[37],"bound":[38,48],"communication":[41],"model,":[42],"we":[43,65,89,109],"prove":[44],"that":[45],"upper":[47],"is":[49],"tight":[50],"class.Our":[54],"improves":[56],"upon":[57],"previously":[59],"known":[60],"2-approximation":[61],"algorithm.":[62],"In":[63,107],"fact,":[64],"also":[66],"exhibit":[67],"another":[68],"which":[70],"obtains":[71],"ratio":[74],"better":[75],"than":[76],"2":[77],"bidders,":[80],"even":[81],"value":[84],"queries":[85],"model.Throughout":[86],"paper":[88],"highlight":[90],"interesting":[91],"connections":[92],"between":[93],"and":[98,101,113],"bidders":[100],"various":[102],"other":[103],"optimization":[105],"problems.":[106,115],"particular,":[108],"discuss":[110],"coverage":[111],"problems":[112],"online":[114]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":5}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}