{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:36Z","timestamp":1750306836340,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,12,1]],"date-time":"2013-12-01T00:00:00Z","timestamp":1385856000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1300\/08"],"award-info":[{"award-number":["1300\/08"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006785","name":"Google","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006785","id-type":"DOI","asserted-by":"publisher"}]},{"name":"BSF","award":["2004105"],"award-info":[{"award-number":["2004105"]}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-07-1-0506"],"award-info":[{"award-number":["N00014-07-1-0506"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS 054829"],"award-info":[{"award-number":["DMS 054829"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Econ. Comput."],"published-print":{"date-parts":[[2013,12]]},"abstract":"<jats:p>We study a model of consensus decision making in which a finite group of Bayesian agents has to choose between one of two courses of action. Each member of the group has a private and independent signal at his or her disposal, giving some indication as to which action is optimal. To come to a common decision, the participants perform repeated rounds of voting. In each round, each agent casts a vote in favor of one of the two courses of action, reflecting his or her current belief, and observes the votes of the rest.<\/jats:p>\n          <jats:p>We provide an efficient algorithm for the calculation the agents have to perform and show that consensus is always reached and that the probability of reaching a wrong decision decays exponentially with the number of agents.<\/jats:p>","DOI":"10.1145\/2542174.2542176","type":"journal-article","created":{"date-parts":[[2014,1,2]],"date-time":"2014-01-02T13:09:43Z","timestamp":1388668183000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Making Consensus Tractable"],"prefix":"10.1145","volume":"1","author":[{"given":"Elchanan","family":"Mossel","sequence":"first","affiliation":[{"name":"University of California, Berkeley and Weizmann Institute of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omer","family":"Tamuz","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1060590.1060686"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1214\/aos\/1176343654"},{"doi-asserted-by":"publisher","key":"e_1_2_1_3_1","DOI":"10.2307\/2118364"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1086\/261849"},{"unstructured":"Jean-Antoine-Nicolas Condorcet. 1785. Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix. De l\u2019Imprimerie Royale Paris.  Jean-Antoine-Nicolas Condorcet. 1785. Essai sur l\u2019application de l\u2019analyse \u00e0 la probabilit\u00e9 des d\u00e9cisions rendues \u00e0 la pluralit\u00e9 des voix . De l\u2019Imprimerie Royale Paris.","key":"e_1_2_1_5_1"},{"unstructured":"European Union. 2007. Treaty of Lisbon. Article 16(4). http:\/\/europa.eu\/lisbon_treaty\/index_en.htm.  European Union. 2007. Treaty of Lisbon. Article 16(4). http:\/\/europa.eu\/lisbon_treaty\/index_en.htm.","key":"e_1_2_1_6_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1016\/S0899-8256(03)00144-1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1016\/j.jet.2006.05.002"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1006\/jeth.1997.2385"},{"unstructured":"Rolf Hammel-Kiesow. 2008. Die Hanse Vol. 2131. C. H. Beck Munich.  Rolf Hammel-Kiesow. 2008. Die Hanse Vol. 2131. C. H. Beck Munich.","key":"e_1_2_1_10_1"},{"volume-title":"Proceedings of the IEEE International Symposium on Information Theory.","author":"Kanoria Y.","key":"e_1_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1214\/aoms\/1177729694"},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.2307\/1914160"},{"doi-asserted-by":"crossref","unstructured":"E. Mossel A. Sly and O. Tamuz. 2012. Asymptotic learning on bayesian social networks. Probab. Theory Related Fields.  E. Mossel A. Sly and O. Tamuz. 2012. Asymptotic learning on bayesian social networks. Probab. Theory Related Fields .","key":"e_1_2_1_14_1","DOI":"10.1007\/s00440-013-0479-y"},{"doi-asserted-by":"crossref","unstructured":"Manuel Mueller-Frank. 2010. A Comment on \u2018Bayesian learning in social networks\u2019. http:\/\/ssrn.com\/abstract=1690943 or DOI:http:\/\/dx.doi.org\/10.2139\/ssrn.1690943.  Manuel Mueller-Frank. 2010. A Comment on \u2018Bayesian learning in social networks\u2019. http:\/\/ssrn.com\/abstract=1690943 or DOI:http:\/\/dx.doi.org\/10.2139\/ssrn.1690943.","key":"e_1_2_1_15_1","DOI":"10.2139\/ssrn.1690943"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.3982\/TE1015"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1016\/j.geb.2008.09.027"},{"doi-asserted-by":"publisher","key":"e_1_2_1_18_1","DOI":"10.1080\/01621459.1983.10477988"},{"unstructured":"Herbert Simon. 1982. Reason in Human Affairs. Stanford University Press Redwood City.  Herbert Simon. 1982. Reason in Human Affairs . Stanford University Press Redwood City.","key":"e_1_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_20_1","DOI":"10.1111\/1468-0262.00113"}],"container-title":["ACM Transactions on Economics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2542174.2542176","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2542174.2542176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:09:56Z","timestamp":1750234196000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2542174.2542176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["10.1145\/2542174.2542176"],"URL":"https:\/\/doi.org\/10.1145\/2542174.2542176","relation":{},"ISSN":["2167-8375","2167-8383"],"issn-type":[{"type":"print","value":"2167-8375"},{"type":"electronic","value":"2167-8383"}],"subject":[],"published":{"date-parts":[[2013,12]]},"assertion":[{"value":"2012-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-02-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}