{"id":"https://openalex.org/W3018978060","doi":"https://doi.org/10.1137/20m1382799","title":"An $O(\\log \\log m)$ Prophet Inequality for Subadditive Combinatorial Auctions","display_name":"An $O(\\log \\log m)$ Prophet Inequality for Subadditive Combinatorial Auctions","publication_year":2022,"publication_date":"2022-05-19","ids":{"openalex":"https://openalex.org/W3018978060","doi":"https://doi.org/10.1137/20m1382799","mag":"3018978060"},"language":"en","primary_location":{"id":"doi:10.1137/20m1382799","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1382799","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112613441","display_name":"Paul D\u00fctting","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100430","display_name":"Google (Switzerland)","ror":"https://ror.org/014f9c269","country_code":"CH","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210100430","https://openalex.org/I4210128969"]},{"id":"https://openalex.org/I909854389","display_name":"London School of Economics and Political Science","ror":"https://ror.org/0090zs177","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I909854389"]}],"countries":["CH","GB"],"is_corresponding":true,"raw_author_name":"Paul D\u00fctting","raw_affiliation_strings":["Google Research, Z\u00fcrich, Switzerland,","Department of Mathematics, London School of Economics, London, UK,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Research, Z\u00fcrich, Switzerland,","institution_ids":["https://openalex.org/I4210100430"]},{"raw_affiliation_string":"Department of Mathematics, London School of Economics, London, UK,","institution_ids":["https://openalex.org/I909854389"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011165333","display_name":"Thomas Ke\u00dfelheim","orcid":"https://orcid.org/0000-0002-9420-9424"},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Thomas Kesselheim","raw_affiliation_strings":["Institute of Computer Science, University of Bonn, Bonn, Germany,"],"raw_orcid":"https://orcid.org/0000-0002-9420-9424","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Bonn, Bonn, Germany,","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082964830","display_name":"Brendan Lucier","orcid":"https://orcid.org/0009-0006-3497-0875"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brendan Lucier","raw_affiliation_strings":["Microsoft Research, Cambridge, MA, USA,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, MA, USA,","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112613441"],"corresponding_institution_ids":["https://openalex.org/I4210100430","https://openalex.org/I909854389"],"apc_list":null,"apc_paid":null,"fwci":1.1865,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.79497652,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"53","issue":"6","first_page":"FOCS20","last_page":"239"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/subadditivity","display_name":"Subadditivity","score":0.9544274210929871},{"id":"https://openalex.org/keywords/combinatorial-auction","display_name":"Combinatorial auction","score":0.6858543157577515},{"id":"https://openalex.org/keywords/common-value-auction","display_name":"Common value auction","score":0.6689256429672241},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5976299047470093},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5683751106262207},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5341576337814331},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5265329480171204},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5080411434173584},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4839046895503998},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.46295270323753357},{"id":"https://openalex.org/keywords/valuation","display_name":"Valuation (finance)","score":0.4624815881252289},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.46245077252388},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4457967281341553},{"id":"https://openalex.org/keywords/incentive-compatibility","display_name":"Incentive compatibility","score":0.4265254735946655},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.41666775941848755},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4164109528064728},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3734256625175476},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.25026288628578186},{"id":"https://openalex.org/keywords/incentive","display_name":"Incentive","score":0.20769938826560974},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.168052077293396},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10536307096481323}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.9544274210929871},{"id":"https://openalex.org/C59919655","wikidata":"https://www.wikidata.org/wiki/Q5150821","display_name":"Combinatorial auction","level":3,"score":0.6858543157577515},{"id":"https://openalex.org/C163239763","wikidata":"https://www.wikidata.org/wiki/Q5153637","display_name":"Common value auction","level":2,"score":0.6689256429672241},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5976299047470093},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5683751106262207},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5341576337814331},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5265329480171204},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5080411434173584},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4839046895503998},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.46295270323753357},{"id":"https://openalex.org/C186027771","wikidata":"https://www.wikidata.org/wiki/Q4008379","display_name":"Valuation (finance)","level":2,"score":0.4624815881252289},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.46245077252388},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4457967281341553},{"id":"https://openalex.org/C91810955","wikidata":"https://www.wikidata.org/wiki/Q7731670","display_name":"Incentive compatibility","level":3,"score":0.4265254735946655},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.41666775941848755},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4164109528064728},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3734256625175476},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25026288628578186},{"id":"https://openalex.org/C29122968","wikidata":"https://www.wikidata.org/wiki/Q1414816","display_name":"Incentive","level":2,"score":0.20769938826560974},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.168052077293396},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10536307096481323},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/20m1382799","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1382799","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1492207119","https://openalex.org/W1495768673","https://openalex.org/W1580387990","https://openalex.org/W1846856248","https://openalex.org/W1882088118","https://openalex.org/W1976086105","https://openalex.org/W1978522505","https://openalex.org/W1991223607","https://openalex.org/W1999069228","https://openalex.org/W2012672170","https://openalex.org/W2018323549","https://openalex.org/W2034828004","https://openalex.org/W2052719152","https://openalex.org/W2088970293","https://openalex.org/W2107403260","https://openalex.org/W2115276154","https://openalex.org/W2275395982","https://openalex.org/W2294025081","https://openalex.org/W2298380537","https://openalex.org/W2326228838","https://openalex.org/W2329590824","https://openalex.org/W2409015594","https://openalex.org/W2482076478","https://openalex.org/W2548642347","https://openalex.org/W2549743857","https://openalex.org/W2611804663","https://openalex.org/W2799064244","https://openalex.org/W2949491553","https://openalex.org/W2950198148","https://openalex.org/W2950351404","https://openalex.org/W2950712789","https://openalex.org/W2951767300","https://openalex.org/W2952123884","https://openalex.org/W2953135426","https://openalex.org/W2963249463","https://openalex.org/W2963515037","https://openalex.org/W2963690476","https://openalex.org/W2963794891","https://openalex.org/W2964161669","https://openalex.org/W2971388482","https://openalex.org/W3033498332","https://openalex.org/W3118124825","https://openalex.org/W4251248798"],"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/W4367393448","https://openalex.org/W1774639417"],"abstract_inverted_index":{"Prophet":[0],"inequalities":[1],"compare":[2],"the":[3,16,36,70,83,87,91,108,150,170,198],"expected":[4,17],"performance":[5],"of":[6,32,40,72,82,90,113,152,175],"an":[7,80,125,145,173,192,205],"online":[8,146],"algorithm":[9],"for":[10,69,102,201],"a":[11,24,99,135,180],"stochastic":[12],"optimization":[13],"problem":[14,53,104],"to":[15,27,78,169,197],"optimal":[18,199],"solution":[19],"in":[20,35,54,144,162],"hindsight.":[21],"They":[22],"are":[23],"major":[25,118],"alternative":[26],"classic":[28],"worst-case":[29],"competitive":[30],"analysis,":[31],"particular":[33],"importance":[34],"design":[37],"and":[38,154,182],"analysis":[39],"simple":[41,181],"(posted-price)":[42],"incentive":[43,183],"compatible":[44,184],"mechanisms":[45],"with":[46,64],"provable":[47],"approximation":[48,111,196],"guarantees.":[49],"A":[50],"central":[51],"open":[52],"this":[55,103,121],"area":[56],"concerns":[57],"subadditive":[58,65,202],"combinatorial":[59],"auctions.":[60],"Here":[61],"$n$":[62],"agents":[63],"valuation":[66],"functions":[67],"compete":[68],"assignment":[71],"$m$":[73],"items.":[74],"The":[75,93],"goal":[76],"is":[77,95,140],"find":[79],"allocation":[81],"items":[84],"that":[85,105,148,158,190],"maximizes":[86],"total":[88],"value":[89],"assignment.":[92],"question":[94,122],"whether":[96],"there":[97],"exists":[98],"prophet":[100,129],"inequality":[101],"significantly":[106],"beats":[107],"best":[109],"known":[110],"factor":[112],"$O(\\log":[114,126,193],"m)$.":[115],"We":[116],"make":[117],"progress":[119],"on":[120,187],"by":[123],"providing":[124],"\\log":[127,194],"m)$":[128,195],"inequality.":[130],"Our":[131],"proof":[132],"goes":[133],"through":[134],"novel":[136],"primal-dual":[137],"approach.":[138],"It":[139],"also":[141],"constructive,":[142],"resulting":[143],"policy":[147],"takes":[149],"form":[151],"static":[153],"anonymous":[155],"item":[156],"prices":[157,189],"can":[159],"be":[160],"computed":[161],"polynomial":[163],"time":[164],"given":[165],"appropriate":[166],"query":[167],"access":[168],"valuations.":[171],"As":[172],"application":[174],"our":[176],"approach,":[177],"we":[178],"construct":[179],"mechanism":[185],"based":[186],"posted":[188],"achieves":[191],"revenue":[200],"valuations":[203],"under":[204],"item-independence":[206],"assumption.":[207]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}