{"id":"https://openalex.org/W4280584838","doi":"https://doi.org/10.1137/17m1136481","title":"On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer","display_name":"On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms for a Unit-Demand Buyer","publication_year":2022,"publication_date":"2022-05-12","ids":{"openalex":"https://openalex.org/W4280584838","doi":"https://doi.org/10.1137/17m1136481"},"language":"en","primary_location":{"id":"doi:10.1137/17m1136481","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1136481","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/A5100329834","display_name":"Xi Chen","orcid":"https://orcid.org/0000-0001-5661-515X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xi Chen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054966819","display_name":"Ilias Diakonikolas","orcid":"https://orcid.org/0000-0002-5486-1856"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilias Diakonikolas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032709054","display_name":"Anthi Orfanou","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anthi Orfanou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084443795","display_name":"Dimitris Paparas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dimitris Paparas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101033892","display_name":"Xiaorui Sun","orcid":"https://orcid.org/0009-0003-8914-2514"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaorui Sun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5069,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6724414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"51","issue":"3","first_page":"492","last_page":"548"},"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.9990000128746033,"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/T11031","display_name":"Game Theory and Applications","score":0.9932000041007996,"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/lottery","display_name":"Lottery","score":0.8317441940307617},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5908702611923218},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.589792013168335},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5167302489280701},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.48874354362487793},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.47910502552986145},{"id":"https://openalex.org/keywords/revenue","display_name":"Revenue","score":0.4711531400680542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4584900438785553},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43375635147094727},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4139575958251953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17362937331199646},{"id":"https://openalex.org/keywords/economics","display_name":"Economics","score":0.1182304322719574},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10036295652389526}],"concepts":[{"id":"https://openalex.org/C2777340749","wikidata":"https://www.wikidata.org/wiki/Q6684955","display_name":"Lottery","level":2,"score":0.8317441940307617},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5908702611923218},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.589792013168335},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5167302489280701},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.48874354362487793},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.47910502552986145},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.4711531400680542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4584900438785553},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43375635147094727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4139575958251953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17362937331199646},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.1182304322719574},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10036295652389526},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","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/17m1136481","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1136481","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":[{"id":"https://openalex.org/G1576381385","display_name":null,"funder_award_id":"CCF- 1423100","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2473526366","display_name":null,"funder_award_id":"CCF-1703925","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2496730367","display_name":null,"funder_award_id":"CCF-1320654","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5392328797","display_name":null,"funder_award_id":"CCF-1149257","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6615897007","display_name":null,"funder_award_id":"EP/L021749/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8022311792","display_name":"Sublinear Algorithms for Approximating Probability Distributions","funder_award_id":"EP/L021749/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320323400","display_name":"Universit\u00e9 Pierre et Marie Curie","ror":"https://ror.org/02en5vm52"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1489711815","https://openalex.org/W1577532981","https://openalex.org/W1974560448","https://openalex.org/W2001983341","https://openalex.org/W2013288181","https://openalex.org/W2029050771","https://openalex.org/W2031502124","https://openalex.org/W2088970293","https://openalex.org/W2133387873","https://openalex.org/W2137407595","https://openalex.org/W2146268012","https://openalex.org/W2169604085","https://openalex.org/W2617513782","https://openalex.org/W2797066271","https://openalex.org/W3036875494","https://openalex.org/W4238495882"],"related_works":["https://openalex.org/W2004731113","https://openalex.org/W1556639976","https://openalex.org/W2366147166","https://openalex.org/W2394167907","https://openalex.org/W2139765960","https://openalex.org/W4300280694","https://openalex.org/W2357035722","https://openalex.org/W2993302023","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"We":[0,77],"study":[1],"the":[2,7,13,43,48,74,89,93,101,105,114,126,131,135,144],"optimal":[3,8,49,75,106,136,160],"lottery":[4,50],"problem":[5,11],"and":[6,64,87],"mechanism":[9,137,161],"design":[10,138],"in":[12],"setting":[14],"of":[15,47,60,96,108,116,134],"a":[16,35],"single":[17],"unit-demand":[18],"buyer":[19],"with":[20,38,58,119],"item":[21,97],"values":[22],"drawn":[23],"from":[24],"independent":[25],"distributions.":[26],"Optimal":[27],"solutions":[28],"to":[29,72,157],"both":[30],"problems":[31],"are":[32,70],"characterized":[33],"by":[34],"linear":[36],"program":[37],"exponentially":[39,67],"many":[40,68],"variables.":[41],"For":[42,130],"menu":[44,107],"size":[45,62,85,121,167],"complexity":[46,133],"problem,":[51,139],"we":[52,140],"present":[53],"an":[54,159],"explicit,":[55],"simple":[56],"instance":[57],"distributions":[59,82,164],"support":[61,84,120,166],"2,":[63],"show":[65,79,141],"that":[66,142],"lotteries":[69],"required":[71],"achieve":[73,100],"revenue.":[76],"also":[78],"that,":[80],"when":[81,163],"have":[83,165],"2":[86,122],"share":[88],"same":[90,102,111,127],"high":[91,128],"value,":[92],"simpler":[94],"scheme":[95],"pricing":[98],"can":[99],"revenue":[103],"as":[104],"lotteries.":[109],"The":[110],"holds":[112],"for":[113],"case":[115],"two":[117],"items":[118],"(but":[123],"not":[124],"necessarily":[125],"value).":[129],"computational":[132],"unless":[143],"polynomial-time":[145],"hierarchy":[146],"collapses":[147],"(more":[148],"exactly,":[149],"${P}^{{NP}}={P}^{{\\#P}}$),":[150],"there":[151],"is":[152],"no":[153],"efficient":[154],"randomized":[155],"algorithm":[156],"implement":[158],"even":[162],"3.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}