{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:05:27Z","timestamp":1777489527909,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055492","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"158-169","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Bernoulli factories and black-box reductions in mechanism design"],"prefix":"10.1145","author":[{"given":"Shaddin","family":"Dughmi","sequence":"first","affiliation":[{"name":"University of Southern California, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason D.","family":"Hartline","sequence":"additional","affiliation":[{"name":"Northwestern University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rad","family":"Niazadeh","sequence":"additional","affiliation":[{"name":"Cornell University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722222"},{"key":"e_1_3_2_2_2_1","unstructured":"Shipra Agrawal Zizhuo Wang and Yinyu Ye. 2009.  Shipra Agrawal Zizhuo Wang and Yinyu Ye. 2009."},{"key":"e_1_3_2_2_3_1","unstructured":"A dynamic near-optimal algorithm for online linear programming. arXiv preprint arXiv:0911.2974 (2009).  A dynamic near-optimal algorithm for online linear programming. arXiv preprint arXiv:0911.2974 (2009)."},{"key":"e_1_3_2_2_4_1","unstructured":"Aaron Archer Christos Papadimitriou Kunal Talwar and \u00c9va Tardos. 2004.  Aaron Archer Christos Papadimitriou Kunal Talwar and \u00c9va Tardos. 2004."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"An approximate truthful mechanism for combinatorial auctions with single parameter agents. Internet Mathematics 1 2 (2004) 129\u2013150.  An approximate truthful mechanism for combinatorial auctions with single parameter agents. Internet Mathematics 1 2 (2004) 129\u2013150.","DOI":"10.1080\/15427951.2004.10129086"},{"key":"e_1_3_2_2_6_1","unstructured":"Moshe Babaioff Robert Kleinberg and Aleksandrs Slivkins. 2013.  Moshe Babaioff Robert Kleinberg and Aleksandrs Slivkins. 2013."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492002.2482602"},{"key":"e_1_3_2_2_8_1","unstructured":"Moshe Babaioff Robert Kleinberg and Aleksandrs Slivkins. 2015.  Moshe Babaioff Robert Kleinberg and Aleksandrs Slivkins. 2015."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2724705"},{"key":"e_1_3_2_2_10_1","unstructured":"Ashwinkumar Badanidiyuru Robert Kleinberg and Aleksandrs Slivkins. 2013.  Ashwinkumar Badanidiyuru Robert Kleinberg and Aleksandrs Slivkins. 2013."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133093"},{"key":"e_1_3_2_2_13_1","unstructured":"Xiao Alison Chen and Zizhuo Wang. 2013. A near-optimal dynamic learning algorithm for online matching problems with concave returns. arXiv preprint arXiv:1307.5934 (2013).  Xiao Alison Chen and Zizhuo Wang. 2013. A near-optimal dynamic learning algorithm for online matching problems with concave returns. arXiv preprint arXiv:1307.5934 (2013)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993581"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055492"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Jason D. Hartline Robert Kleinberg and Azarakhsh Malekian. 2011. Bayesian incentive compatibility via matchings. SODA (2011).   Jason D. Hartline Robert Kleinberg and Azarakhsh Malekian. 2011. Bayesian incentive compatibility via matchings. SODA (2011).","DOI":"10.1137\/1.9781611973082.58"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Jason D. Hartline Robert Kleinberg and Azarakhsh Malekian. 2015. Bayesian incentive compatibility via matchings. Games and Economic Behavior 92 C (2015) 401\u2013429.  Jason D. Hartline Robert Kleinberg and Azarakhsh Malekian. 2015. Bayesian incentive compatibility via matchings. Games and Economic Behavior 92 C (2015) 401\u2013429.","DOI":"10.1016\/j.geb.2015.02.002"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806732"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20130712"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.36"},{"key":"e_1_3_2_2_21_1","unstructured":"Mark Huber. 2015. Optimal linear Bernoulli factories for small mean problems. CoRR abs\/1507.00843 (2015).  Mark Huber. 2015. Optimal linear Bernoulli factories for small mean problems. CoRR abs\/1507.00843 (2015)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/175007.175019"},{"key":"e_1_3_2_2_23_1","unstructured":"Thomas Kesselheim Andreas T\u00f6nnis Klaus Radke and Berthold V\u00f6cking. 2014.  Thomas Kesselheim Andreas T\u00f6nnis Klaus Radke and Berthold V\u00f6cking. 2014."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591810"},{"key":"e_1_3_2_2_25_1","first-page":"1","article-title":"The Bernoulli factory, its extensions and applications","volume":"2010","author":"\u0141atuszy\u0144ski Krzysztof","year":"2010","journal-title":"Proceedings of IWAP"},{"key":"e_1_3_2_2_26_1","unstructured":"Rajeev Motwani and Prabhakar Raghavan. 2010.  Rajeev Motwani and Prabhakar Raghavan. 2010."},{"key":"e_1_3_2_2_27_1","unstructured":"Randomized algorithms. Chapman & Hall\/CRC.  Randomized algorithms. Chapman & Hall\/CRC."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","location":"Montreal Canada","acronym":"STOC '17","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055492","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055492","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":27,"alternative-id":["10.1145\/3055399.3055492","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055492","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}