{"id":"https://openalex.org/W2171091864","doi":"https://doi.org/10.1145/2229012.2229067","title":"Monotone branch-and-bound search for restricted combinatorial auctions","display_name":"Monotone branch-and-bound search for restricted combinatorial auctions","publication_year":2012,"publication_date":"2012-06-04","ids":{"openalex":"https://openalex.org/W2171091864","doi":"https://doi.org/10.1145/2229012.2229067","mag":"2171091864"},"language":"en","primary_location":{"id":"doi:10.1145/2229012.2229067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2229012.2229067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM Conference on Electronic Commerce","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:11956915","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062989871","display_name":"John K. Lai","orcid":null},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Lai","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086173064","display_name":"David C. Parkes","orcid":"https://orcid.org/0000-0002-2701-3464"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Parkes","raw_affiliation_strings":["Harvard University, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, Cambridge, MA, USA","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":null,"apc_paid":null,"fwci":2.2429,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.89626463,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"705","last_page":"722"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":1.0,"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":1.0,"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/T11161","display_name":"Consumer Market Behavior and Pricing","score":0.9902999997138977,"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"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9722999930381775,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"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/combinatorial-auction","display_name":"Combinatorial auction","score":0.8305904865264893},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.7024034261703491},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7021875381469727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.677432119846344},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.6751060485839844},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.612729549407959},{"id":"https://openalex.org/keywords/incentive-compatibility","display_name":"Incentive compatibility","score":0.5715578198432922},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5289393067359924},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5095508098602295},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4446330666542053},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.42132487893104553},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.4121955335140228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3667184114456177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24056529998779297},{"id":"https://openalex.org/keywords/incentive","display_name":"Incentive","score":0.23252588510513306},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.21375471353530884}],"concepts":[{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.8305904865264893},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.7024034261703491},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7021875381469727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.677432119846344},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.6751060485839844},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.612729549407959},{"id":"https://openalex.org/C91810955","wikidata":"https://www.wikidata.org/wiki/Q7731670","display_name":"Incentive compatibility","level":3,"score":0.5715578198432922},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5289393067359924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5095508098602295},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4446330666542053},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.42132487893104553},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.4121955335140228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3667184114456177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24056529998779297},{"id":"https://openalex.org/C29122968","wikidata":"https://www.wikidata.org/wiki/Q1414816","display_name":"Incentive","level":2,"score":0.23252588510513306},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.21375471353530884},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2229012.2229067","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2229012.2229067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 13th ACM Conference on Electronic Commerce","raw_type":"proceedings-article"},{"id":"pmh:oai:dash.harvard.edu:1/11956915","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:11956915","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"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":"","raw_type":"Conference Paper"}],"best_oa_location":{"id":"pmh:oai:dash.harvard.edu:1/11956915","is_oa":true,"landing_page_url":"http://nrs.harvard.edu/urn-3:HUL.InstRepos:11956915","pdf_url":null,"source":{"id":"https://openalex.org/S4306401540","display_name":"Digital Access to Scholarship at Harvard (DASH) (Harvard University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I136199984","host_organization_name":"Harvard University","host_organization_lineage":["https://openalex.org/I136199984"],"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":"","raw_type":"Conference Paper"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8502886088","display_name":"ICES: Small: Heuristic Mechanism Design","funder_award_id":"1101570","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320333566","display_name":"National Defense Science and Engineering Graduate","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1571472016","https://openalex.org/W1593826002","https://openalex.org/W1762430620","https://openalex.org/W1838485156","https://openalex.org/W1968143987","https://openalex.org/W2013469527","https://openalex.org/W2029050771","https://openalex.org/W2035977618","https://openalex.org/W2041211404","https://openalex.org/W2054039722","https://openalex.org/W2062830639","https://openalex.org/W2098248004","https://openalex.org/W2103751307","https://openalex.org/W2109649220","https://openalex.org/W2122648618","https://openalex.org/W2138536735","https://openalex.org/W2144964927","https://openalex.org/W2148928475","https://openalex.org/W2340604309","https://openalex.org/W4366084930","https://openalex.org/W6681613590","https://openalex.org/W6724904386"],"related_works":["https://openalex.org/W2610226722","https://openalex.org/W1502128320","https://openalex.org/W1965161364","https://openalex.org/W1571950539","https://openalex.org/W2475673136","https://openalex.org/W2399045738","https://openalex.org/W53387826","https://openalex.org/W2492074436","https://openalex.org/W15370767","https://openalex.org/W3123927169"],"abstract_inverted_index":{"Faced":[0],"with":[1,19,89],"an":[2,20,58,63,79],"intractable":[3],"optimization":[4],"problem,":[5],"a":[6,14,31,44,73,90],"common":[7],"approach":[8],"to":[9,36,46,92,95],"computational":[10,99],"mechanism":[11],"design":[12],"seeks":[13,35],"polynomial":[15],"time":[16],"approximation":[17,21,114],"algorithm":[18,76],"guarantee.":[22],"Rather":[23],"than":[24,109],"adopt":[25],"this":[26],"worst-case":[27],"viewpoint,":[28],"we":[29],"introduce":[30],"new":[32],"paradigm":[33],"that":[34,57,110],"obtain":[37,72],"good":[38],"performance":[39,108],"on":[40,83,101],"typical":[41],"instances":[42],"through":[43],"modification":[45],"the":[47,66,84,93],"branch-and-bound":[48],"search":[49,75,88],"paradigm.":[50],"Incentive":[51],"compatibility":[52],"in":[53],"single-dimensional":[54],"domains":[55],"requires":[56],"outcome":[59,94],"improves":[60],"monotonically":[61],"for":[62],"agent":[64],"as":[65],"agent's":[67],"reported":[68],"value":[69],"increases.":[70],"We":[71],"monotone":[74],"by":[77],"coupling":[78],"explicit":[80],"sensitivity":[81],"analysis":[82],"decisions":[85],"made":[86],"during":[87],"correction":[91],"ensure":[96],"monotonicity.":[97],"Extensive":[98],"experiments":[100],"single-minded":[102],"combinatorial":[103],"auctions":[104],"show":[105],"better":[106],"welfare":[107],"available":[111],"from":[112],"existing":[113],"algorithms.":[115]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}