{"id":"https://openalex.org/W4299842315","doi":"https://doi.org/10.1145/2764468.2764479","title":"Ignorance is Almost Bliss","display_name":"Ignorance is Almost Bliss","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W4299842315","doi":"https://doi.org/10.1145/2764468.2764479"},"language":"en","primary_location":{"id":"doi:10.1145/2764468.2764479","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764468.2764479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1407.4094","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5024803432","display_name":"Avrim Blum","orcid":"https://orcid.org/0000-0003-2450-5102"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Avrim Blum","raw_affiliation_strings":["CMU, Pittsburgh, USA"],"affiliations":[{"raw_affiliation_string":"CMU, Pittsburgh, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071538560","display_name":"John P. Dickerson","orcid":"https://orcid.org/0000-0003-2231-680X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John P. Dickerson","raw_affiliation_strings":["CMU, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"CMU, Pittsburgh, PA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080772091","display_name":"Nika Haghtalab","orcid":"https://orcid.org/0000-0002-8612-2089"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nika Haghtalab","raw_affiliation_strings":["CMU, pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"CMU, pittsburgh, PA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102964654","display_name":"Ariel D. Procaccia","orcid":"https://orcid.org/0000-0003-0318-491X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ariel D. Procaccia","raw_affiliation_strings":["CMU, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"CMU, Pittsburgh, PA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023571961","display_name":"T\u00fcomas Sandholm","orcid":"https://orcid.org/0000-0001-8861-9366"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tuomas Sandholm","raw_affiliation_strings":["CMU, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"CMU, Pittsburgh, PA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103101651","display_name":"Ankit Sharma","orcid":"https://orcid.org/0000-0002-5646-5929"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ankit Sharma","raw_affiliation_strings":["Solvvy Inc., Palo Alto, CA, USA"],"affiliations":[{"raw_affiliation_string":"Solvvy Inc., Palo Alto, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5024803432"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4554,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.84786496,"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":"325","last_page":"342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.994700014591217,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9779000282287598,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9700999855995178,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.5765002965927124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5577799081802368},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5201699733734131},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5039355158805847},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4674939215183258},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.46710363030433655},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.457526296377182},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.45097655057907104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42490434646606445},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.421764612197876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33860915899276733},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3362957239151001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2803102135658264}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5765002965927124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5577799081802368},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5201699733734131},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5039355158805847},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4674939215183258},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.46710363030433655},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.457526296377182},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.45097655057907104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42490434646606445},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.421764612197876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33860915899276733},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3362957239151001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2803102135658264},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"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/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2764468.2764479","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764468.2764479","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Sixteenth ACM Conference on Economics and Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1407.4094","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.4094","pdf_url":"https://arxiv.org/pdf/1407.4094","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1407.4094","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.4094","pdf_url":"https://arxiv.org/pdf/1407.4094","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G151214518","display_name":null,"funder_award_id":"CCF-1415460","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2111735816","display_name":"Eager: Discrete Optimization Algorithms for 21st Century Algorithms","funder_award_id":"1415460","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2614476939","display_name":null,"funder_award_id":"1320620","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2942592542","display_name":null,"funder_award_id":"CCF-1101668, CCF-1116892, CCF-1215883, CCF-1415460, IIS-0964579, IIS-1065251, IIS-1320620, IIS-1350598","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3208095955","display_name":"RI: Mediuim: Abstraction, Equilibrium Finding, Safe Opponent Exploitation, and Robust Strategies for Imperfect-Information Games","funder_award_id":"0964579","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3747561669","display_name":"CAREER: A Broad Synthesis of Artificial Intelligence and Social Choice","funder_award_id":"1350598","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4019442646","display_name":null,"funder_award_id":"CCF-1116892","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4532361846","display_name":null,"funder_award_id":"IIS-1065251","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4577065350","display_name":"ICES: Small: Computational Fair Division: From Cake Cutting to Cloud Computing","funder_award_id":"1215883","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6894402473","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G70831629","display_name":"AF: Small: Frameworks for Design and Analysis of Heuristics","funder_award_id":"1116892","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7324853821","display_name":null,"funder_award_id":"IIS-1350598","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7536487576","display_name":null,"funder_award_id":"CCF-1215883","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7597483545","display_name":"RI: Medium: Interactive Transfer Learning in Dynamic Environments","funder_award_id":"1065251","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8449190896","display_name":"ICES: Small: New and Better Markets via Automated Market Making","funder_award_id":"1101668","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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/F4320306132","display_name":"American Society for Engineering Education","ror":"https://ror.org/03ac64295"},{"id":"https://openalex.org/F4320306151","display_name":"Alfred P. Sloan Foundation","ror":"https://ror.org/052csg198"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4299842315.pdf"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W68213954","https://openalex.org/W178538629","https://openalex.org/W1500676409","https://openalex.org/W1506936706","https://openalex.org/W1548308776","https://openalex.org/W1788659242","https://openalex.org/W1909971775","https://openalex.org/W1933599012","https://openalex.org/W1992753463","https://openalex.org/W1997271069","https://openalex.org/W2010428983","https://openalex.org/W2012193618","https://openalex.org/W2014511571","https://openalex.org/W2086698286","https://openalex.org/W2109309849","https://openalex.org/W2117063032","https://openalex.org/W2117820474","https://openalex.org/W2125010663","https://openalex.org/W2131552728","https://openalex.org/W2140118062","https://openalex.org/W2146700677","https://openalex.org/W2149744080","https://openalex.org/W2153568425","https://openalex.org/W2241862190","https://openalex.org/W2293140664","https://openalex.org/W2295070815","https://openalex.org/W2307437521","https://openalex.org/W2340985688","https://openalex.org/W2614365644","https://openalex.org/W2950292344","https://openalex.org/W2951221187","https://openalex.org/W3121213783","https://openalex.org/W3122360041","https://openalex.org/W3123258615","https://openalex.org/W3124133339","https://openalex.org/W4233172940","https://openalex.org/W4233190915","https://openalex.org/W4242907262","https://openalex.org/W4252680380","https://openalex.org/W4389615669","https://openalex.org/W6601357468"],"related_works":["https://openalex.org/W2382566571","https://openalex.org/W2349321798","https://openalex.org/W2366686860","https://openalex.org/W2962917430","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W1496354680","https://openalex.org/W2952847377","https://openalex.org/W2129303870","https://openalex.org/W3214829809"],"abstract_inverted_index":{"The":[0],"stochastic":[1,29,81,164],"matching":[2,9,82],"problem":[3,34,86,210],"deals":[4],"with":[5,47,137,185,232],"finding":[6],"a":[7,11,25,38,97,106,128,138,148,174,265],"maximum":[8,39],"in":[10,126,276,279],"graph":[12],"whose":[13],"edges":[14,101],"are":[15],"unknown":[16],"but":[17,238],"can":[18],"be":[19],"accessed":[20],"via":[21],"queries.":[22],"This":[23,191],"is":[24,35,87,193],"special":[26],"case":[27],"of":[28,41,44,70,90,100,109,131,143,153,179,202,220,257,269],"$k$-set":[30,165,208],"packing,":[31],"where":[32,230],"the":[33,71,80,88,110,124,154,180,196,206,218,226,252,258],"to":[36,163,195,225],"find":[37],"packing":[40,166,209],"sets,":[42],"each":[43],"which":[45],"exists":[46],"some":[48,68],"probability.":[49],"In":[50],"this":[51,120,135],"paper,":[52],"we":[53],"provide":[54],"edge":[55,271],"and":[56,104,212,247],"set":[57],"query":[58],"algorithms":[59,224],"for":[60,79,114,205],"these":[61,223],"two":[62],"problems,":[63],"respectively,":[64],"that":[65,94,146,172,263],"provably":[66],"achieve":[67],"fraction":[69,108,152,178],"omniscient":[72,111,155,181],"optimal":[73,112,182],"solution.":[74],"Our":[75],"main":[76],"theoretical":[77],"result":[78,136],"(i.e.,":[83,140],"$2$-set":[84],"packing)":[85],"design":[89],"an":[91,115,169],"\\emph{adaptive}":[92],"algorithm":[93,122,145,171],"queries":[95,125,188,272],"only":[96,127,186],"constant":[98,129],"number":[99,130,268],"per":[102,189,273],"vertex":[103,274],"achieves":[105,147,173],"$(1-\\epsilon)$":[107],"solution,":[113,183],"arbitrarily":[116],"small":[117,267],"$\\epsilon>0$.":[118],"Moreover,":[119],"adaptive":[121,170],"performs":[123],"rounds.":[132],"We":[133,157,215,241],"complement":[134],"\\emph{non-adaptive}":[139],"one":[141],"round":[142],"queries)":[144],"$(0.5":[149],"-":[150,176],"\\epsilon)$":[151,177],"optimum.":[156],"also":[158],"extend":[159],"both":[160,244],"our":[161],"results":[162,275],"by":[167],"designing":[168],"$(\\frac{2}{k}":[175],"again":[184],"$O(1)$":[187],"element.":[190],"guarantee":[192],"close":[194],"best":[197],"known":[198],"polynomial-time":[199],"approximation":[200],"ratio":[201],"$\\frac{3}{k+1}":[203],"-\\epsilon$":[204],"\\emph{deterministic}":[207],"[Furer":[211],"Yu,":[213],"2013]":[214],"empirically":[216],"explore":[217],"application":[219],"(adaptations":[221],"of)":[222],"kidney":[227,261],"exchange":[228,262],"problem,":[229],"patients":[231],"end-stage":[233],"renal":[234],"failure":[235],"swap":[236],"willing":[237],"incompatible":[239],"donors.":[240],"show":[242],"on":[243,248],"generated":[245],"data":[246,250],"real":[249],"from":[251],"first":[253],"169":[254],"match":[255],"runs":[256],"UNOS":[259],"nationwide":[260],"even":[264],"very":[266],"non-adaptive":[270],"large":[277],"gains":[278],"expected":[280],"successful":[281],"matches.":[282]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-14T08:04:32.555800","created_date":"2022-10-03T00:00:00"}