{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T21:46:21Z","timestamp":1773092781840,"version":"3.50.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046118","type":"print"},{"value":"9783030046125","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_22","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"327-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Byzantine Preferential Voting"],"prefix":"10.1007","author":[{"given":"Darya","family":"Melnyk","sequence":"first","affiliation":[]},{"given":"Yuyi","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"5","key":"22_CR1","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 23:1\u201323:27 (2008)","journal-title":"J. ACM"},{"key":"22_CR2","volume-title":"Social Choice and Individual Values","author":"KJ Arrow","year":"1951","unstructured":"Arrow, K.J.: Social Choice and Individual Values, 1st edn. Cowles Foundation, New Haven (1951)","edition":"1"},{"key":"22_CR3","volume-title":"Social Choice and Individual Values","author":"KJ Arrow","year":"1963","unstructured":"Arrow, K.J.: Social Choice and Individual Values, 2nd edn. Wiley, New York (1963)","edition":"2"},{"issue":"2","key":"22_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00303169","volume":"6","author":"J Bartholdi","year":"1989","unstructured":"Bartholdi, J., Tovey, C.A., Trick, M.A.: Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare 6(2), 157\u2013165 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"JJ Bartholdi","year":"1989","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welfare 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welfare"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1018324807861","volume":"990","author":"GW Bassett","year":"1999","unstructured":"Bassett, G.W., Persky, J.: Robust voting. Public Choice 990(3), 299\u2013310 (1999)","journal-title":"Public Choice"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, PODC 1983, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0035753","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1989","unstructured":"Berman, P., Garay, J.A.: Asymptotically optimal distributed consensus. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds.) ICALP 1989. LNCS, vol. 372, pp. 80\u201394. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0035753"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus. In: 30th Annual Symposium on Foundations of Computer Science, FOCS, October 1989","DOI":"10.1109\/SFCS.1989.63511"},{"key":"22_CR10","unstructured":"Betzler, N., Niedermeier, R., Woeginger, G.J.: Unweighted coalitional manipulation under the Borda rule is NP-hard. In: IJCAI, vol. 11, pp. 55\u201360 (2011)"},{"issue":"2","key":"22_CR11","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous Byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987)","journal-title":"Inf. Comput."},{"key":"22_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107446984","volume-title":"Handbook of Computational Social Choice","author":"F Brandt","year":"2016","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice, 1st edn. Cambridge University Press, New York (2016)","edition":"1"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-35668-1_13","volume-title":"Distributed Computing and Networking","author":"H Chauhan","year":"2013","unstructured":"Chauhan, H., Garg, V.K.: Democratic elections in faulty distributed systems. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, R.K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 176\u2013191. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35668-1_13"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Davies, J., Katsirelos, G., Narodytska, N., Walsh, T.: Complexity of and algorithms for Borda manipulation. In: AAAI, vol. 11, pp. 657\u2013662 (2011)","DOI":"10.1609\/aaai.v25i1.7873"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.L.: Spearman\u2019s footrule as a measure of disarray. J. R. Stat. Soc. Ser. B (Methodol.) 39, 262\u2013268 (1977)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Doerr, B., Goldberg, L.A., Minder, L., Sauerwald, T., Scheideler, C.: Stabilizing consensus with the power of two choices. In: Proceedings of the Twenty-third Annual ACM Symposium on Parallelism in Algorithms and Architectures, SPAA (2011)","DOI":"10.1145\/1989493.1989516"},{"issue":"3","key":"22_CR17","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International Conference on World Wide Web, WWW 2001, pp. 613\u2013622. ACM, New York (2001)","DOI":"10.1145\/371920.372165"},{"issue":"1","key":"22_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01783662","volume":"4","author":"AD Fekete","year":"1990","unstructured":"Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. Distrib. Comput. 4(1), 9\u201329 (1990)","journal-title":"Distrib. Comput."},{"issue":"4","key":"22_CR20","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"22_CR21","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"4","key":"22_CR22","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny, J.G.: Mathematics without numbers. Daedalus 88(4), 577\u2013591 (1959)","journal-title":"Daedalus"},{"key":"22_CR23","unstructured":"Kemeny, J.G., Snell, J.L.: Mathematical Models in the Social Sciences. Introductions to Higher Mathematics, Blaisdell, Waltham (Mass.) (1962)"},{"issue":"1\/2","key":"22_CR24","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall, M.G.: A new measure of rank correlation. Biometrika 30(1\/2), 81\u201393 (1938)","journal-title":"Biometrika"},{"issue":"2","key":"22_CR25","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2837019","volume":"63","author":"V King","year":"2016","unstructured":"King, V., Saia, J.: Byzantine agreement in expected polynomial time. J. ACM 63(2), 13:1\u201313:21 (2016)","journal-title":"J. ACM"},{"issue":"3","key":"22_CR26","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"22_CR27","doi-asserted-by":"publisher","first-page":"680","DOI":"10.2307\/1907651","volume":"20","author":"KO May","year":"1952","unstructured":"May, K.O.: A set of independent necessary and sufficient conditions for simple majority decision. Econometrica 20(4), 680\u2013684 (1952)","journal-title":"Econometrica"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Melnyk, D., Wattenhofer, R.: Byzantine agreement with interval validity. In: 37th Annual IEEE International Symposium on Reliable Distributed Systems, SRDS (2018)","DOI":"10.1109\/SRDS.2018.00036"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Mendes, H., Herlihy, M.: Multidimensional approximate agreement in Byzantine asynchronous systems. In: Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, STOC (2013)","DOI":"10.1145\/2488608.2488657"},{"issue":"6","key":"22_CR30","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s00446-014-0240-5","volume":"28","author":"H Mendes","year":"2015","unstructured":"Mendes, H., Herlihy, M., Vaidya, N., Garg, V.K.: Multidimensional agreement in Byzantine systems. Distrib. Comput. 28(6), 423\u2013441 (2015)","journal-title":"Distrib. Comput."},{"key":"22_CR31","unstructured":"Pareto, V.: Manuale di Economia Politica con una Introduzione alla Scienza Sociale. Societ\u00e0 Editrice Libraria (1919)"},{"issue":"2","key":"22_CR32","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Rosenschein, J.S., Kaminka, G.A.: On the robustness of preference aggregation in noisy environments. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, p. 66. ACM (2007)","DOI":"10.1145\/1329125.1329205"},{"issue":"2","key":"22_CR34","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"T Srikanth","year":"1987","unstructured":"Srikanth, T., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comput."},{"key":"22_CR35","unstructured":"Stolz, D., Wattenhofer, R.: Byzantine agreement with median validity. In: 19th International Conference on Principles of Distributed Systems, OPODIS (2015)"},{"issue":"1","key":"22_CR36","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1257\/jep.9.1.27","volume":"9","author":"N Tideman","year":"1995","unstructured":"Tideman, N.: The single transferable vote. J. Econ. Perspect. 9(1), 27\u201338 (1995)","journal-title":"J. Econ. Perspect."},{"key":"22_CR37","doi-asserted-by":"crossref","unstructured":"Tseng, L.: Voting in the presence of Byzantine faults. In: 2017 IEEE 22nd Pacific Rim International Symposium on Dependable Computing (PRDC), January 2017","DOI":"10.1109\/PRDC.2017.11"},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Garg, V.K.: Byzantine vector consensus in complete graphs. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC (2013)","DOI":"10.1145\/2484239.2484256"},{"key":"22_CR39","volume-title":"Distributed Ledger Technology: The Science of the Blockchain","author":"R Wattenhofer","year":"2017","unstructured":"Wattenhofer, R.: Distributed Ledger Technology: The Science of the Blockchain, 2nd edn. CreateSpace Independent Publishing Platform, Scotts Valley (2017)","edition":"2"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-77918-6_21","volume-title":"Approximation and Online Algorithms","author":"A van Zuylen","year":"2008","unstructured":"van Zuylen, A., Williamson, D.P.: Deterministic algorithms for rank aggregation and other ranking and clustering problems. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 260\u2013273. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77918-6_21"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04612-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T16:03:36Z","timestamp":1720800216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}