{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:36:50Z","timestamp":1743068210619,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_8","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"119-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["In the Beginning There Were n Agents: Founding and Amending a Constitution"],"prefix":"10.1007","author":[{"given":"Ben","family":"Abramowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ehud","family":"Shapiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Alcantud, J.C.R., Laruelle, A.: Collective identity functions with status quo. Math. Soc. Sci. 93, 159\u2013166 (2018)","DOI":"10.1016\/j.mathsocsci.2018.03.005"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Alcantud, J.C.R., Laruelle, A.: Independent collective identity functions as voting rules. Theory Decis. 89, 1\u201313 (2020)","DOI":"10.1007\/s11238-019-09743-2"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Barbera, S., Jackson, M.O.: Choosing how to choose: self-stable majority rules and constitutions. Q. J. Econ. 119(3), 1011\u20131048 (2004)","DOI":"10.1162\/0033553041502207"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Bhattacharya, M.: Constitutionally consistent voting rules over single-peaked domains. Soc. Choice Welf. 52(2), 225\u2013246 (2019)","DOI":"10.1007\/s00355-018-1145-1"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Brandt, F., Brill, M., Harrenstein, P.: Extending tournament solutions. Soc. Choice Welf. 51(2), 193\u2013222 (2018)","DOI":"10.1007\/s00355-018-1112-x"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Campbell, D.E., Kelly, J.S.: Impossibility theorems in the Arrovian framework. Handb. Soc. Choice Welf. 1, 35\u201394 (2002)","DOI":"10.1016\/S1574-0110(02)80005-4"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cho, W.J., Saporiti, A.: Group identification with (incomplete) preferences. J. Public Econ. Theory 22(1), 170\u2013189 (2020)","DOI":"10.1111\/jpet.12387"},{"key":"8_CR9","unstructured":"Danezis, G., Mittal, P.: Sybilinfer: detecting sybil nodes using social networks. In: NDSS, San Diego, CA, pp. 1\u201315 (2009)"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"de Almeida, A.T., Morais, D.C., Nurmi, H.: Criterion based choice of rules. In: Systems, Procedures and Voting Rules in Context. AGDN, vol. 9, pp. 57\u201366. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30955-8_7","DOI":"10.1007\/978-3-030-30955-8_7"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Diermeier, D., Prato, C., Vlaicu, R.: Procedural choice in majoritarian organizations. Am. J. Polit. Sci. 59(4), 866\u2013879 (2015)","DOI":"10.1111\/ajps.12142"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Diermeier, D., Prato, C., Vlaicu, R.: Self-enforcing partisan procedures. J. Polit. 82(3), 937\u2013954 (2020)","DOI":"10.1086\/707585"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Dimitrov, D., Sung, S.C., Xu, Y.: Procedural group identification. Math. Soc. Sci. 54(2), 137\u2013146 (2007)","DOI":"10.1016\/j.mathsocsci.2007.06.001"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Fioravanti, F., Tohm\u00e9, F.: Asking infinite voters \u2018Who is a J?\u2019: group identification problems in $$\\mathbb{N}$$. J. Classif. 37(1), 58\u201365 (2020)","DOI":"10.1007\/s00357-018-9295-5"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Fishburn, P.C.: Condorcet social choice functions. SIAM J. Appl. Math. 33(3), 469\u2013489 (1977)","DOI":"10.1137\/0133030"},{"key":"8_CR16","unstructured":"Houy, N., et al.: A note on the impossibility of a set of constitutions stable at different levels. Technical report, Universit\u00e9 Panth\u00e9on-Sorbonne (Paris 1) (2004)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Jackson, M.O.: A crash course in implementation theory. Soc. Choice Welf. 18(4), 655\u2013708 (2001)","DOI":"10.1007\/s003550100152"},{"key":"8_CR18","unstructured":"Kasher, A., Rubinstein, A.: On the question \u201cWho is a J?\u201d a social choice approach. Logique et Analyse 160, 385\u2013395 (1997)"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Koray, S.: Self-selective social choice functions verify Arrow and Gibbard-Satterthwaite theorems. Econometrica 68(4), 981\u2013996 (2000)","DOI":"10.1111\/1468-0262.00143"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Lagunoff, R.: Dynamic stability and reform of political institutions. Games Econ. Behav. 67(2), 569\u2013583 (2009)","DOI":"10.1016\/j.geb.2009.02.002"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"May, K.O.: A set of independent necessary and sufficient conditions for simple majority decision. Econometrica: J. Econom. Soc. 20, 680\u2013684 (1952)","DOI":"10.2307\/1907651"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"Miller, A.D.: Group identification. Games Econ. Behav. 63(1), 188\u2013202 (2008)","DOI":"10.1016\/j.geb.2007.08.006"},{"key":"8_CR23","doi-asserted-by":"publisher","unstructured":"Nurmi, H.: The choice of voting rules based on preferences over criteria. In: Kami\u0144ski, B., Kersten, G., Szapiro, T. (eds.) Outlooks and Insights on Group Decision and Negotiation. GDN 2015. LNBIP, vol. 218, pp. 241\u2013252. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19515-5_19","DOI":"10.1007\/978-3-319-19515-5_19"},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Poupko, O., Shahaf, G., Shapiro, E., Talmon, N.: Sybil-resilient conductance-based community growth. In: van Bevern, R., Kucherov, G. (eds.) Computer Science \u2013 Theory and Applications. CSR 2019. LNCS, vol. 11532, pp. 359\u2013371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_31","DOI":"10.1007\/978-3-030-19955-5_31"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Poupko, O., Shahaf, G., Shapiro, E., Talmon, N.: Building a sybil-resilient digital community utilizing trust-graph connectivity. IEEE\/ACM Trans. Network. PP, 1\u201313 (2021)","DOI":"10.1109\/TNET.2021.3084303"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"Sen, A.: Collective Choice and Social Welfare. Harvard University Press, Cambridge (2017)","DOI":"10.4159\/9780674974616"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Shahaf, G., Shapiro, E., Talmon, N.: Sybil-resilient reality-aware social choice. arXiv preprint arXiv:1807.11105 (2018)","DOI":"10.24963\/ijcai.2019\/81"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Shahaf, G., Shapiro, E., Talmon, N.: Genuine personal identifiers and mutual sureties for sybil-resilient community formation. arXiv preprint arXiv:1904.09630 (2019)","DOI":"10.1007\/978-3-030-60975-7_24"},{"key":"8_CR29","unstructured":"Sung, S.C., Dimitrov, D.: On the axiomatic characterization of \u201cWho is a J?\u201d. Logique et Analyse 48, 101\u2013112 (2005)"},{"key":"8_CR30","doi-asserted-by":"publisher","unstructured":"Suzuki, T., Horita, M.: How to order the alternatives, rules, and the rules to choose rules: when the endogenous procedural choice regresses. In: Kami\u0144ski, B., Kersten, G., Szapiro, T. (eds.) Outlooks and Insights on Group Decision and Negotiation. GDN 2015. LNBIP, vol. 218, pp. 47\u201359. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19515-5_4","DOI":"10.1007\/978-3-319-19515-5_4"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Suzuki, T., Horita, M.: A characterization for procedural choice based on dichotomous preferences over criteria. Group Decis. Negot.: Multidisc. Perspect. 388, 91 (2020)","DOI":"10.1007\/978-3-030-48641-9_7"},{"key":"8_CR32","doi-asserted-by":"crossref","unstructured":"Wei, W., Xu, F., Tan, C.C., Li, Q.: SybilDefender: defend against sybil attacks in large social networks. In: 2012 Proceedings IEEE INFOCOM, pp. 1951\u20131959. IEEE (2012)","DOI":"10.1109\/INFCOM.2012.6195572"},{"key":"8_CR33","doi-asserted-by":"crossref","unstructured":"Yu, H., Gibbons, P.B., Kaminsky, M., Xiao, F.: SybilLimit: a near-optimal social network defense against sybil attacks. In: 2008 IEEE Symposium on Security and Privacy (SP 2008), pp. 3\u201317. IEEE (2008)","DOI":"10.1109\/SP.2008.13"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.D.: SybilGuard: defending against sybil attacks via social networks. IEEE\/ACM Trans. Network. 16(3), 576\u2013589 (2008)","DOI":"10.1109\/TNET.2008.923723"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:30Z","timestamp":1673647290000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","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":"27","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":"0","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":"47% - 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":"7","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)"}}]}}