{"id":"https://openalex.org/W2746065370","doi":"https://doi.org/10.1137/16m1067275","title":"Worst-Case Mechanism Design via Bayesian Analysis","display_name":"Worst-Case Mechanism Design via Bayesian Analysis","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2746065370","doi":"https://doi.org/10.1137/16m1067275","mag":"2746065370"},"language":"en","primary_location":{"id":"doi:10.1137/16m1067275","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1067275","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dr.ntu.edu.sg/bitstream/10356/86533/1/Worst-Case%20Mechanism%20Design%20via%20Bayesian%20Analysis.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082638698","display_name":"Xiaohui Bei","orcid":"https://orcid.org/0000-0002-0870-5019"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Xiaohui Bei","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore 637371"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore 637371","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100446683","display_name":"Ning Chen","orcid":"https://orcid.org/0000-0001-6958-2182"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Ning Chen","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore 637371"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore 637371","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010685949","display_name":"Nick Gravin","orcid":"https://orcid.org/0000-0002-3845-947X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nick Gravin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025408809","display_name":"Pinyan Lu","orcid":"https://orcid.org/0009-0005-0569-4122"},"institutions":[{"id":"https://openalex.org/I181679659","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62","country_code":"CN","type":"education","lineage":["https://openalex.org/I181679659"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Pinyan Lu","raw_affiliation_strings":["Shanghai University of Finance and Economics, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"Shanghai University of Finance and Economics, Shanghai, China","institution_ids":["https://openalex.org/I181679659"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5082638698"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":1.3379,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.83145311,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"46","issue":"4","first_page":"1428","last_page":"1448"},"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.9945999979972839,"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/T12288","display_name":"Optimization and Search Problems","score":0.9847999811172485,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.9732770919799805},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8722587823867798},{"id":"https://openalex.org/keywords/mechanism-design","display_name":"Mechanism design","score":0.5844764113426208},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5537015795707703},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.5499012470245361},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.5306873321533203},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.5233078002929688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4650503396987915},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44974687695503235},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43138790130615234},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41736167669296265},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40514370799064636},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3959577679634094},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.3468543291091919},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.16865843534469604}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.9732770919799805},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8722587823867798},{"id":"https://openalex.org/C153517567","wikidata":"https://www.wikidata.org/wiki/Q26090","display_name":"Mechanism design","level":2,"score":0.5844764113426208},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5537015795707703},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.5499012470245361},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5306873321533203},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.5233078002929688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4650503396987915},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44974687695503235},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43138790130615234},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41736167669296265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40514370799064636},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3959577679634094},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.3468543291091919},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.16865843534469604},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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.1137/16m1067275","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1067275","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/86533","is_oa":true,"landing_page_url":"http://hdl.handle.net/10220/44041","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/86533/1/Worst-Case%20Mechanism%20Design%20via%20Bayesian%20Analysis.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"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":"Journal Article"}],"best_oa_location":{"id":"pmh:oai:dr.ntu.edu.sg:10356/86533","is_oa":true,"landing_page_url":"http://hdl.handle.net/10220/44041","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/86533/1/Worst-Case%20Mechanism%20Design%20via%20Bayesian%20Analysis.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"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":"Journal Article"},"sustainable_development_goals":[{"display_name":"Partnerships for the goals","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2746065370.pdf","grobid_xml":"https://content.openalex.org/works/W2746065370.grobid-xml"},"referenced_works_count":46,"referenced_works":["https://openalex.org/W32127252","https://openalex.org/W1580387990","https://openalex.org/W1836056621","https://openalex.org/W1931679055","https://openalex.org/W1954834360","https://openalex.org/W1965093697","https://openalex.org/W1978522505","https://openalex.org/W1985253316","https://openalex.org/W1987352480","https://openalex.org/W1991223607","https://openalex.org/W1993197246","https://openalex.org/W1995275762","https://openalex.org/W1998788558","https://openalex.org/W2009322344","https://openalex.org/W2012634103","https://openalex.org/W2015007620","https://openalex.org/W2021734699","https://openalex.org/W2022013502","https://openalex.org/W2029050771","https://openalex.org/W2030286268","https://openalex.org/W2033885045","https://openalex.org/W2038644905","https://openalex.org/W2045927286","https://openalex.org/W2052719152","https://openalex.org/W2054039722","https://openalex.org/W2064335940","https://openalex.org/W2077124610","https://openalex.org/W2078040677","https://openalex.org/W2079025269","https://openalex.org/W2099604706","https://openalex.org/W2104334470","https://openalex.org/W2105296258","https://openalex.org/W2114383736","https://openalex.org/W2118442327","https://openalex.org/W2120100612","https://openalex.org/W2126085282","https://openalex.org/W2126170153","https://openalex.org/W2133040106","https://openalex.org/W2135012080","https://openalex.org/W2149600441","https://openalex.org/W2163900650","https://openalex.org/W2171735304","https://openalex.org/W2294210014","https://openalex.org/W2953139329","https://openalex.org/W2962711478","https://openalex.org/W4247157595"],"related_works":["https://openalex.org/W2235694368","https://openalex.org/W1550607748","https://openalex.org/W2548642347","https://openalex.org/W4300592161","https://openalex.org/W2950198148","https://openalex.org/W4287322635","https://openalex.org/W3210745387","https://openalex.org/W3178236364","https://openalex.org/W1774639417","https://openalex.org/W187768306"],"abstract_inverted_index":{"Budget":[0],"feasible":[1,61,134],"mechanism":[2,115,135,158,164,271],"design":[3,159,165],"is":[4,54,125],"the":[5,13,22,38,42,47,52,67,73,98,156,162,184,189,198,202,246,252,264],"study":[6],"of":[7,34,46,72,97,128,220,254,266],"procurement":[8],"combinatorial":[9],"auctions":[10],"in":[11,51,183,245,251],"which":[12],"sellers":[14],"have":[15,87],"private":[16],"costs":[17,256],"to":[18,26,66,148,161,188],"produce":[19],"items,":[20],"and":[21,94,119,175,257],"buyer":[23],"(auctioneer)":[24],"aims":[25],"maximize":[27],"her":[28],"valuation":[29,56],"function":[30],"on":[31,41,102],"a":[32,88,131,206,218,224,238,259,267],"subset":[33],"purchased":[35],"items":[36],"under":[37],"budget":[39,60,133],"constraint":[40],"total":[43],"payment.":[44],"One":[45],"most":[48],"important":[49],"questions":[50],"field":[53],"\u201cwhich":[55],"domains":[57],"admit":[58],"truthful":[59,261],"mechanisms":[62],"with":[63],"`small'":[64],"approximations":[65],"social":[68],"optimum?\u201d":[69],"Singer":[70,95],"[Proceedings":[71,96],"51st":[74],"FOCS,":[75],"IEEE":[76],"Press,":[77],"Piscataway,":[78],"NJ,":[79],"2010,":[80],"pp.":[81,109],"765--774]":[82],"showed":[83],"that":[84,121],"submodular":[85,221],"functions":[86,118,244],"constant":[89,209,239,269],"approximation":[90,114,210,240,270],"mechanism.":[91],"Dobzinski,":[92],"Papadimitriou,":[93],"12th":[99],"ACM":[100],"Conference":[101],"Electronic":[103],"Commerce,":[104],"ACM,":[105],"New":[106],"York,":[107],"2011,":[108],"273--282]":[110],"gave":[111],"an":[112,145],"$O(\\log^2n)$":[113],"for":[116,137,211,233,241],"subadditive":[117,138,216,235,243],"remarked":[120],"\u201cA":[122],"fundamental":[123],"question":[124],"whether,":[126],"regardless":[127],"computational":[129],"constraints,":[130],"constant-factor":[132],"exists":[136],"functions.\u201d":[139],"In":[140],"this":[141,149,152],"paper,":[142],"we":[143,154,179,200],"give":[144],"affirmative":[146],"answer":[147],"question.":[150],"To":[151],"end":[153],"relax":[155],"prior-free":[157,190,268],"framework":[160,166,191],"Bayesian":[163,185,247],"(these":[167],"are":[168],"two":[169],"standard":[170],"approaches":[171],"from":[172],"computer":[173],"science":[174],"economics,":[176],"respectively).":[177],"Then":[178],"convert":[180],"our":[181],"results":[182],"setting":[186],"back":[187],"by":[192],"employing":[193],"Yao's":[194,273],"minimax":[195,274],"principle.":[196,275],"Along":[197],"way,":[199],"obtain":[201],"following":[203],"results:":[204],"(i)":[205],"polynomial":[207,225],"time":[208,226],"XOS":[212],"valuations":[213],"(a.k.a.":[214],"fractionally":[215],"valuations,":[217,236],"superset":[219],"functions),":[222],"(ii)":[223],"$O(\\log":[227],"n":[228],"/":[229],"\\log":[230,231],"n)$-approximation":[232],"general":[234,242],"(iii)":[237],"framework---we":[248],"allow":[249],"correlation":[250],"distribution":[253],"sellers'":[255],"provide":[258],"universally":[260],"mechanism,":[262],"(iv)":[263],"existence":[265],"via":[272]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}