{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:19:45Z","timestamp":1725740385032},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642398599"},{"type":"electronic","value":"9783642398605"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39860-5_13","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:07:36Z","timestamp":1373504856000},"page":"165-179","source":"Crossref","is-referenced-by-count":0,"title":["Extracting Reputation with Knock-Out Tournament-Based Pairwise Elicitation in Complex Social Networks"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Centeno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ram\u00f3n","family":"Hermoso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Fasli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","first-page":"1","volume-title":"Proceedings of the 6th ACM Conference on Electronic Commerce, EC 2005","author":"A. Altman","year":"2005","unstructured":"Altman, A., Tennenholtz, M.: Ranking systems: the pagerank axioms. In: Proceedings of the 6th ACM Conference on Electronic Commerce, EC 2005, pp. 1\u20138. ACM, New York (2005)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/ICDM.2010.149","volume-title":"Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM 2010","author":"S. Balakrishnan","year":"2010","unstructured":"Balakrishnan, S., Chopra, S.: Two of a kind or the ratings game? adaptive pairwise preferences and latent factor models. In: Proceedings of the 2010 IEEE International Conference on Data Mining, ICDM 2010, pp. 725\u2013730. IEEE Computer Society, Washington, DC (2010)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Fishburn, P.C.: Voting procedures. In: Arrow, K.J., Sen, A.K., Suzumura, K. (eds.) Handbook of Social Choice and Welfare, vol.\u00a01, ch.4, pp. 173\u2013236. Elsevier (2002)","DOI":"10.1016\/S1574-0110(02)80008-X"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Conitzer, V.: Eliciting single-peaked preferences using comparison queries. In: Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2007, pp. 65:1\u201365:8. ACM, New York (2007)","DOI":"10.1145\/1329125.1329204"},{"key":"13_CR5","first-page":"109","volume-title":"Proceedings of the 21st International Joint Conference on Artifical Intelligence, IJCAI 2009","author":"V. Conitzer","year":"2009","unstructured":"Conitzer, V., Rognlie, M., Xia, L.: Preference functions that score rankings and maximum likelihood estimation. In: Proceedings of the 21st International Joint Conference on Artifical Intelligence, IJCAI 2009, pp. 109\u2013115. Morgan Kaufmann Publishers Inc., San Francisco (2009)"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"026117","DOI":"10.1103\/PhysRevE.78.026117","volume":"78","author":"F. Fu","year":"2008","unstructured":"Fu, F., Hauert, C., Nowak, M.A., Wang, L.: Reputation-based partner choice promotes cooperation in social networks. Phys. Rev. E\u00a078, 026117 (2008)","journal-title":"Phys. Rev. E"},{"key":"13_CR7","first-page":"1055","volume-title":"Proceedings of AAMAS 2007","author":"K.K. Fullam","year":"2007","unstructured":"Fullam, K.K., Barber, K.S.: Dynamically learning sources of trust information: experience vs. reputation. In: Proceedings of AAMAS 2007, pp. 1055\u20131062. ACM, New York (2007)"},{"issue":"4","key":"13_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst.\u00a020(4), 422\u2013446 (2002)","journal-title":"ACM Trans. Inf. Syst."},{"key":"13_CR9","unstructured":"Negahban, S., Oh, S., Shah, D.: Iterative ranking from pair-wise comparisons. CoRR, abs\/1209.1688 (2012)"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1145\/544741.544853","volume-title":"Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 1, AAMAS 2002","author":"J.M. Pujol","year":"2002","unstructured":"Pujol, J.M., Sang\u00fcesa, R., Delgado, J.: Extracting reputation in multi agent systems by means of social network topology. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 1, AAMAS 2002, pp. 467\u2013474. ACM, New York (2002), http:\/\/doi.acm.org\/10.1145\/544741.544853"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1086\/229574","volume":"96","author":"W. Raub","year":"1990","unstructured":"Raub, W., Weesie, J.: Reputation and efficiency in social interactions: An example of network effects. American Journal of Sociology\u00a096, 626\u2013654 (1990)","journal-title":"American Journal of Sociology"},{"issue":"12","key":"13_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/355112.355122","volume":"43","author":"P. Resnick","year":"2000","unstructured":"Resnick, P., Kuwabara, K., Zeckhauser, R., Friedman, E.: Reputation systems. Commun. ACM\u00a043(12), 45\u201348 (2000)","journal-title":"Commun. ACM"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Vega-Redondo, F.: Complex Social Networks. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511804052"},{"key":"13_CR14","unstructured":"Vu, T., Altman, A., Shoham, Y.: On the complexity of schedule control problems for knockout tournaments. In: Proceedings of AAMAS 2009, vol.\u00a01, pp. 225\u2013232. IFAAMAS, Richland (2009)"},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2036264.2036273","volume":"3","author":"T. Vu","year":"2011","unstructured":"Vu, T., Shoham, Y.: Fair seeding in knockout tournaments. ACM Trans. Intell. Syst. Technol. 3(1), 9:1\u20139:17 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."}],"container-title":["Lecture Notes in Computer Science","Agreement Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39860-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T01:00:19Z","timestamp":1563411619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39860-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642398599","9783642398605"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39860-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}