{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:34:43Z","timestamp":1750221283384,"version":"3.41.0"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T00:00:00Z","timestamp":1506297600000},"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":["SIGecom Exch."],"published-print":{"date-parts":[[2017,9,25]]},"abstract":"<jats:p>In this letter, we report on our work providing a polynomial time reduction from Bayesian incentive compatible mechanism design to Bayesian algorithm design for welfare maximization problems. Unlike prior results, our reduction achieves exact incentive compatibility for problems with multidimensional and continuous type spaces.<\/jats:p>","DOI":"10.1145\/3144722.3144728","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:33:53Z","timestamp":1506515633000},"page":"58-71","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Bernoulli factories and black-box reductions in mechanism design"],"prefix":"10.1145","volume":"16","author":[{"given":"Shaddin","family":"Dughmi","sequence":"first","affiliation":[{"name":"University of Southern California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jason D.","family":"Hartline","sequence":"additional","affiliation":[{"name":"Northwestern University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rad","family":"Niazadeh","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,9,25]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.93"},{"key":"e_1_2_1_2_1","unstructured":"Agrawal S. Wang Z. and Ye Y. 2009. A dynamic near-optimal algorithm for online linear programming. arXiv preprint arXiv:0911.2974.  Agrawal S. Wang Z. and Ye Y. 2009. A dynamic near-optimal algorithm for online linear programming. arXiv preprint arXiv:0911.2974."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1110.0534"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2724705"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.30"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.57"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214019"},{"key":"e_1_2_1_8_1","unstructured":"Chen X. A. and Wang Z. 2013. A near-optimal dynamic learning algorithm for online matching problems with concave returns. arXiv preprint arXiv:1307.5934.  Chen X. A. and Wang Z. 2013. A near-optimal dynamic learning algorithm for online matching problems with concave returns. arXiv preprint arXiv:1307.5934."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993581"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786754"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055492"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2014.01.007"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2307\/1914083"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.58"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2015.02.002"},{"volume-title":"Proceedings of the forty-second ACM symposium on Theory of computing. ACM, 301--310","author":"Hartline J. D.","key":"e_1_2_1_16_1"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1257\/aer.20130712"},{"key":"e_1_2_1_18_1","unstructured":"Huber M. 2015. Optimal linear Bernoulli factories for small mean problems. CoRR abs\/1507.00843.  Huber M. 2015. Optimal linear Bernoulli factories for small mean problems. CoRR abs\/1507.00843."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/175007.175019"},{"key":"e_1_2_1_20_1","first-page":"1","article-title":"The Bernoulli factory, its extensions and applications","volume":"2010","author":"\u0141atuszy\u0144ski K.","year":"2010","journal-title":"Proceedings of IWAP"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(88)90135-4"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1214\/105051604000000549"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/game.1999.0790"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.54"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-4068(87)90007-3"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0531(75)90050-2"}],"container-title":["ACM SIGecom Exchanges"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3144722.3144728","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3144722.3144728","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:22Z","timestamp":1750212682000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3144722.3144728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,25]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,9,25]]}},"alternative-id":["10.1145\/3144722.3144728"],"URL":"https:\/\/doi.org\/10.1145\/3144722.3144728","relation":{},"ISSN":["1551-9031"],"issn-type":[{"type":"electronic","value":"1551-9031"}],"subject":[],"published":{"date-parts":[[2017,9,25]]},"assertion":[{"value":"2017-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}