{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T14:36:10Z","timestamp":1777041370291,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T00:00:00Z","timestamp":1506297600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61170201"],"award-info":[{"award-number":["61170201"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472344"],"award-info":[{"award-number":["61472344"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s11036-017-0934-6","type":"journal-article","created":{"date-parts":[[2017,9,25]],"date-time":"2017-09-25T12:38:08Z","timestamp":1506343088000},"page":"344-351","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Voting Aggregation Algorithm for Optimal Social Satisfaction"],"prefix":"10.1007","volume":"23","author":[{"given":"Ling","family":"Teng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5810-613X","authenticated-orcid":false,"given":"Junwu","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,25]]},"reference":[{"issue":"99","key":"934_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/JIOT.2017.2737479","volume":"PP","author":"H Lu","year":"2017","unstructured":"Lu H, Li Y, Mu S et al (2017) Motor anomaly detection for unmanned aerial vehicles using reinforcement learning[J]. IEEE Internet Things J PP(99):1\u20131","journal-title":"IEEE Internet Things J"},{"issue":"6","key":"934_CR2","first-page":"1","volume":"29","author":"H Lu","year":"2016","unstructured":"Lu H, Li B, Zhu J et al (2016) Wound intensity correction and segmentation with convolutional neural networks[J]. Concurr Comput Pract Exper 29(6):1\u201310","journal-title":"Concurr Comput Pract Exper"},{"issue":"1","key":"934_CR3","first-page":"81","volume":"37","author":"H Guo","year":"2011","unstructured":"Guo H, Cao L (2011) Improvement of Borda voting method in meta search engine [J]. Comput Eng 37 (1):81\u201383","journal-title":"Comput Eng"},{"issue":"10","key":"934_CR4","first-page":"8","volume":"9","author":"LR Xia","year":"2013","unstructured":"Xia LR (2013) Introduction of computational social choice theory [J]. Commun CCF 9(10):8\u201314","journal-title":"Commun CCF"},{"key":"934_CR5","first-page":"1","volume-title":"Social choice theory as a foundation for multi-agent systems[M]","author":"U Endriss","year":"2014","unstructured":"Endriss U (2014) Social choice theory as a foundation for multi-agent systems[M]. Springer International Publishing, Berlin, pp 1\u20136"},{"issue":"2","key":"934_CR6","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1093\/comjnl\/bxh164","volume":"49","author":"J Pitt","year":"2006","unstructured":"Pitt J, Kamara L, Sergot M et al (2006) Voting in multi-agent systems[J]. Comput J 49(2):156\u2013170","journal-title":"Comput J"},{"key":"934_CR7","doi-asserted-by":"crossref","unstructured":"Mao A, Procaccia AD, Chen Y (2013) Better human computation through principled voting[C]. In: Proceedings of the 27th AAAI Conference on Artificial Intelligence. AAAI Press, 2013:1142\u20131148","DOI":"10.1609\/aaai.v27i1.8460"},{"issue":"4393","key":"934_CR8","first-page":"187","volume":"3","author":"H Nurmi","year":"1987","unstructured":"Nurmi H (1987) Comparing voting systems[M]. Springer Netherlands 3(4393):187\u2013189","journal-title":"Springer Netherlands"},{"key":"934_CR9","first-page":"126","volume":"1","author":"HA Soufiani","year":"2012","unstructured":"Soufiani HA, Parkes DC, Xia L (2012) Random utility theory for social choice[J]. Adv Neural Inf Process Syst 1:126\u2013134","journal-title":"Adv Neural Inf Process Syst"},{"issue":"4","key":"934_CR10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00183045","volume":"8","author":"JJIII Bartholdi","year":"1991","unstructured":"Bartholdi JJ III, Orlin JB (1991) Single transferable vote resists strategic voting. Soc Choice Welfare 8 (4):341\u2013 354","journal-title":"Soc Choice Welfare"},{"issue":"3-4","key":"934_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11127-016-0361-4","volume":"168","author":"E Lagerspetz","year":"2016","unstructured":"Lagerspetz E (2016) Plurality, approval, or Borda? A nineteenth century dispute on voting rules[J]. Publ Choice 168 (3-4):1\u201313","journal-title":"Publ Choice"},{"key":"934_CR12","first-page":"501C512","volume":"3","author":"R Richie","year":"2004","unstructured":"Richie R (2004) Instant runoff voting: what mexico (and others) could learn. Elect Law J 3:501C512","journal-title":"Elect Law J"},{"key":"934_CR13","doi-asserted-by":"publisher","unstructured":"Brams SJ, Kilgour DM (2014) Satisfaction Approval Voting. In: Fara R., Leech D., Salles M. (eds) Voting Power and Procedures. Studies in Choice and Welfare. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-05158-1_18","DOI":"10.1007\/978-3-319-05158-1_18"},{"key":"934_CR14","first-page":"75","volume":"4","author":"J Chen","year":"2015","unstructured":"Chen J (2015) The game theory of the classic voting model-theory and practice of Borda Count [J]. Admin Forum 4:75\u2013 79","journal-title":"Admin Forum"},{"key":"934_CR15","unstructured":"Aziz H, Walsh T (2015) Algorithms for two variants of Satisfaction Approval Voting. CoRR arXiv: 1501.02144"},{"issue":"2","key":"934_CR16","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1006\/jmps.1996.0014","volume":"40","author":"JC Falmagne","year":"1996","unstructured":"Falmagne JC, Regenwetter M (1996) A random utility model for approval voting[J]. J Math Psychol 40 (2):152\u2013 159","journal-title":"J Math Psychol"},{"issue":"2","key":"934_CR17","doi-asserted-by":"crossref","first-page":"308C327","DOI":"10.1111\/1475-6765.12028","volume":"53","author":"SP Singh","year":"2014","unstructured":"Singh SP (2014) Not all election winners are equal: satisfaction with democracy and the nature of the vote[J]. Eur J Polit Res 53(2):308C327","journal-title":"Eur J Polit Res"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11036-017-0934-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-017-0934-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-017-0934-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T10:37:03Z","timestamp":1659523023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11036-017-0934-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,25]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["934"],"URL":"https:\/\/doi.org\/10.1007\/s11036-017-0934-6","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"value":"1383-469X","type":"print"},{"value":"1572-8153","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,25]]}}}