{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:02:17Z","timestamp":1762300937198,"version":"3.40.3"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031207952"},{"type":"electronic","value":"9783031207969"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20796-9_5","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"59-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Verifiable Crowd Computing: Coping with\u00a0Bounded Rationality"],"prefix":"10.1007","author":[{"given":"Lu","family":"Dong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shikha","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Dolev, D., Goden, R., Halpern, J.: Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 53\u201362 (2006)","DOI":"10.1145\/1146381.1146393"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J., Porth, C.: Bar fault tolerance for cooperative services. In: Proceedings. of the 20th ACM Symposium on Operating Systems Principles, pp. 45\u201358 (2005)","DOI":"10.1145\/1095809.1095816"},{"key":"5_CR3","unstructured":"Amazon.com.: Amazon Mechanical Turk. http:\/\/www.mturk.com. Accessed 2 Oct 2017"},{"key":"5_CR4","unstructured":"Anderson, D.: BOINC: a system for public-resource computing and storage. In: Proceedings of the 5th IEEE\/ACM International Workshop on Grid Computing, pp. 4\u201310 (2004)"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Azar, P.D., Micali, S.: Super-efficient rational proofs. In: Proceedings of the 14th Annual ACM conference on Electronic Commerce (EC), pp. 29\u201330 (2013)","DOI":"10.1145\/2482540.2482561"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Combinatorial agency. In: Proceedings of the 7th ACM Conference on Electronic Commerce, pp. 18\u201328 (2006)","DOI":"10.1145\/1134707.1134710"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Mixed strategies in combinatorial agency. In: Proceedings of the 2nd international Workshop on Internet & Network Economics, pp. 353\u2013364 (2006)","DOI":"10.1007\/11944874_32"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-04645-2_11","volume-title":"Algorithmic Game Theory","author":"M Babaioff","year":"2009","unstructured":"Babaioff, M., Feldman, M., Nisan, N.: Free-riding and free-labor in combinatorial agency. In: Mavronicolas, M., Papadopoulou, V.G. (eds.) SAGT 2009. LNCS, vol. 5814, pp. 109\u2013121. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04645-2_11"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Bielefeld, R.S.: Reexamination of the perfectness concept for equilibrium points in extensive games. In: Models of Strategic Rationality. Theory and Decision Library C, vol. 2, pp. 1\u201331. Springer, Dordrecht (1988). https:\/\/doi.org\/10.1007\/978-94-015-7774-8_1","DOI":"10.1007\/978-94-015-7774-8_1"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chen, J., McCauley, S., Singh, S.: Rational proofs with multiple provers. In: Proceedings of the 7th Innovations in Theoretical Computer Science Conference (ITCS), pp. 237\u2013248 (2016)","DOI":"10.1145\/2840728.2840744"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-99660-8_14","volume-title":"Algorithmic Game Theory","author":"J Chen","year":"2018","unstructured":"Chen, J., McCauley, S., Singh, S.: Efficient rational proofs with strong utility-gap guarantees. In: Deng, X. (ed.) SAGT 2018. LNCS, vol. 11059, pp. 150\u2013162. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99660-8_14"},{"key":"5_CR12","unstructured":"Chen, J., McCauley, S., Singh, S.: Non-cooperative rational interactive proofs. In: 27th Annual European Symposium on Algorithms (ESA 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2019)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Christoforou, E., Fern\u00e1ndez Anta, A., Georgiou, C., Mosteiro, M.A.: Algorithmic mechanisms for Internet supercomputing under unreliable communication. In: Proceedings of the 10th IEEE International Symposium on Network Computing and Applications, pp. 275\u2013280 (2011)","DOI":"10.1109\/NCA.2011.46"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1109\/TC.2012.186","volume":"63","author":"E Christoforou","year":"2014","unstructured":"Christoforou, E., Fern\u00e1ndez Anta, A., Georgiou, C., Mosteiro, M.A.: Algorithmic mechanisms for reliable master-worker Internet-based computing. IEEE Trans. Comput. 63(1), 179\u2013195 (2014)","journal-title":"IEEE Trans. Comput."},{"issue":"17","key":"5_CR15","doi-asserted-by":"publisher","first-page":"2363","DOI":"10.1002\/cpe.3104","volume":"25","author":"E Christoforou","year":"2013","unstructured":"Christoforou, E., Fern\u00e1ndez Anta, A., Georgiou, C., Mosteiro, M.A., S\u00e1nchez, A.: Applying the dynamics of evolution to achieve reliability in master-worker computing. Concurr. Comput. Pract. Exp. 25(17), 2363\u20132380 (2013)","journal-title":"Concurr. Comput. Pract. Exp."},{"issue":"2","key":"5_CR16","first-page":"669","volume":"34","author":"J Conlisk","year":"1996","unstructured":"Conlisk, J.: Why bounded rationality? J. Econ. Lit. 34(2), 669\u2013700 (1996)","journal-title":"J. Econ. Lit."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Dong, C., Wang, Y., Aldweesh, A., McCorry, P., van Moorsel, A.: Betrayal, distrust, and rationality: Smart counter-collusion contracts for verifiable cloud computing. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 211\u2013227 (2017)","DOI":"10.1145\/3133956.3134032"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Eidenbenz, R., Schmid, S.: Combinatorial agency with audits. In: Proceedings of the International Conference on Game Theory for Networks, pp. 374\u2013383 (2009)","DOI":"10.1109\/GAMENETS.2009.5137423"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1111\/1467-937X.t01-1-00023","volume":"69","author":"K Eliaz","year":"2002","unstructured":"Eliaz, K.: Fault tolerant implementation. Rev. Econ. Stud. 69, 589\u2013610 (2002)","journal-title":"Rev. Econ. Stud."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez, A., Georgiou, C., Lopez, L., Santos, A.: Reliable Internet-based computing in the presence of malicious workers. Parall. Process. Lett. 22(1) (2012)","DOI":"10.1142\/S0129626412500028"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Georgiou, C., Mosteiro, M.A.: Designing mechanisms for reliable Internet-based computing. In: Proceedings of the 7th IEEE International Symposium on Network Computing and Applications, pp. 315\u2013324 (2008)","DOI":"10.1109\/NCA.2008.41"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Georgiou, C., Mosteiro, M.A.: Algorithmic mechanisms for Internet-based master-worker computing with untrusted and selfish workers. In: Proceedings of the 24th IEEE International Parallel and Distributed Processing Symposium, pp. 1\u201311 (2010)","DOI":"10.1109\/IPDPS.2010.5470409"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Georgiou, C., Mosteiro, M.A., Pareja, D.: Algorithmic mechanisms for reliable crowdsourcing computation under collusion. Public Lib. Sci. One 10(3) (2015)","DOI":"10.1371\/journal.pone.0116520"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez Anta, A., Georgiou, C., Mosteiro, M.A., Pareja, D.: Multi-round master-worker computing: a repeated game approach. In: Proceedings of the IEEE 35th Symposium on Reliable Distributed Systems, pp. 31\u201340. IEEE (2016)","DOI":"10.1109\/SRDS.2016.015"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Gairing, M.: Malicious Bayesian congestion games. In: Proceedings of the 6th Workshop on Approximation and Online Algorithms, pp. 119\u2013132 (2008)","DOI":"10.1007\/978-3-540-93980-1_10"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Golle, P., Mironov, I.: Uncheatable distributed computations. In: Proceedings of the Cryptographer\u2019s Track at RSA Conference 2001, pp. 425\u2013440 (2001)","DOI":"10.1007\/3-540-45353-9_31"},{"issue":"1","key":"5_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01258206","volume":"24","author":"O Gossner","year":"1995","unstructured":"Gossner, O.: The folk theorem for finitely repeated games with mixed strategies. Internat. J. Game Theory 24(1), 95\u2013107 (1995)","journal-title":"Internat. J. Game Theory"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Guo, S., Hub\u00e1\u010dek, P., Rosen, A., Vald, M.: Rational arguments: single round delegation with sublinear verification. In: Proceedings of the 5th Annual Conference on Innovations in Theoretical Computer Science (ITCS), pp. 523\u2013540 (2014)","DOI":"10.1145\/2554797.2554845"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Guo, S., Hub\u00e1\u010dek, P., Rosen, A., Vald, M.: Rational sumchecks. In: Theory of Cryptography Conference, pp. 319\u2013351 (2016)","DOI":"10.1007\/978-3-662-49099-0_12"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10723-009-9131-6","volume":"7","author":"E Heien","year":"2009","unstructured":"Heien, E., Anderson, D., Hagihara, K.: Computing low latency batches with unreliable workers in volunteer computing environments. J. Grid Comput. 7, 501\u2013518 (2009)","journal-title":"J. Grid Comput."},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"1778","DOI":"10.1109\/TIFS.2019.2949440","volume":"15","author":"Q Hu","year":"2019","unstructured":"Hu, Q., Wang, S., Cheng, X., Ma, L., Bie, R.: Solving the crowdsourcing dilemma using the zero-determinant strategies. IEEE Trans. Inf. Forensics Secur. 15, 1778\u20131789 (2019)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5_CR32","unstructured":"It, F.: http:\/\/fold.it\/portal\/.Accessed 11 June 2016"},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.pmcj.2018.10.001","volume":"51","author":"X Jin","year":"2018","unstructured":"Jin, X., Li, M., Sun, X., Guo, C., Liu, J.: Reputation-based multi-auditing algorithmic mechanism for reliable mobile crowdsensing. Pervasive Mob. Comput. 51, 73\u201387 (2018)","journal-title":"Pervasive Mob. Comput."},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Kondo, D., et al.: Characterizing result errors in internet desktop grids. In: Proceedings of the 13th International European Conference on Parallel and Distributed Computing, pp. 361\u2013371 (2007)","DOI":"10.1007\/978-3-540-74466-5_40"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Konwar, K., Rajasekaran, S., Shvartsman, A.: Robust network supercomputing with malicious processes. In: Proceedings of the 20th International Symposium on Distributed Computing, pp. 474\u2013488 (2006)","DOI":"10.1007\/11864219_33"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Kuhn, M., Schmid, S., Wattenhofer, R.: Distributed asymmetric verification in computational grids. In: Proceedings of the 22nd IEEE International Parallel & Distributed Processing Symposium, pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536244"},{"key":"5_CR37","unstructured":"Li, H.C., et al.: Flightpath: obedience vs choice in cooperative services. In: Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation, pp. 355\u2013368 (2008)"},{"key":"5_CR38","unstructured":"Li, H.C., et al.: Bar gossip. In: Proceedings of the 6th USENIX Symposium on Operating Systems Design and Implementation, pp. 191\u2013204 (2006)"},{"key":"5_CR39","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-78078-8_24","volume-title":"Quality, Reliability, Security and Robustness in Heterogeneous Systems","author":"K Lu","year":"2018","unstructured":"Lu, K., Yang, J., Gong, H., Li, M.: Classification-based reputation mechanism for master-worker computing system. In: Wang, L., Qiu, T., Zhao, W. (eds.) QShine 2017. LNICST, vol. 234, pp. 238\u2013247. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78078-8_24"},{"key":"5_CR40","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Schmid, S., Wattenhofer, R.: When selfish meets evil: byzantine players in a virus inoculation game. In: Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 35\u201344 (2006)","DOI":"10.1145\/1146381.1146391"},{"key":"5_CR41","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press (1994)"},{"key":"5_CR42","unstructured":"Project, T.S.: http:\/\/setiathome.berkeley.edu. Accessed 11 June 2016"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Rubinstein, A.: Modeling Bounded Rationality. MIT Press, London (1998)","DOI":"10.7551\/mitpress\/4702.001.0001"},{"issue":"4","key":"5_CR44","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/S0167-739X(01)00077-2","volume":"18","author":"L Sarmenta","year":"2002","unstructured":"Sarmenta, L.: Sabotage-tolerance mechanisms for volunteer computing systems. Futur. Gener. Comput. Syst. 18(4), 561\u2013572 (2002)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Treuille, A., et al.: Predicting protein structures with a multiplayer online game. Nature 466 (2010)","DOI":"10.1038\/nature09304"},{"issue":"6","key":"5_CR46","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.4149\/cai_2018_6_1293","volume":"37","author":"J Yu","year":"2019","unstructured":"Yu, J., Li, Y.: New methods of uncheatable grid computing. Comput. Inform. 37(6), 1293\u20131312 (2019)","journal-title":"Comput. Inform."},{"key":"5_CR47","doi-asserted-by":"crossref","unstructured":"Yurkewych, M., Levine, B., Rosenberg, A.: On the cost-ineffectiveness of redundancy in commercial p2p computing. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, pp. 280\u2013288 (2005)","DOI":"10.1145\/1102120.1102157"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmic Wisdom"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20796-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T10:22:59Z","timestamp":1728642179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20796-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031207952","9783031207969"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20796-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/ijtcs2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","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":"19","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":"76% - 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":"3","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)"}}]}}