{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T00:26:32Z","timestamp":1717028792210},"reference-count":49,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T00:00:00Z","timestamp":1719792000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1016\/j.tcs.2024.114631","type":"journal-article","created":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T15:29:24Z","timestamp":1715700564000},"page":"114631","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Verifiable Crowd Computing: Coping with bounded rationality"],"prefix":"10.1016","volume":"1004","author":[{"given":"Lu","family":"Dong","sequence":"first","affiliation":[]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[]},{"given":"Shikha","family":"Singh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2024.114631_br0010","series-title":"Frontiers of Algorithmic Wisdom","first-page":"59","article-title":"Verifiable Crowd Computing: coping with bounded rationality","author":"Dong","year":"2022"},{"key":"10.1016\/j.tcs.2024.114631_br0020","author":"Project"},{"key":"10.1016\/j.tcs.2024.114631_br0030","author":"It"},{"key":"10.1016\/j.tcs.2024.114631_br0040","article-title":"Predicting protein structures with a multiplayer online game","volume":"466","author":"Treuille","year":"2010","journal-title":"Nature"},{"issue":"4","key":"10.1016\/j.tcs.2024.114631_br0060","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/S0167-739X(01)00077-2","article-title":"Sabotage-tolerance mechanisms for volunteer computing systems","volume":"18","author":"Sarmenta","year":"2002","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.tcs.2024.114631_br0070","series-title":"Proc. of the 13th International European Conference on Parallel and Distributed Computing","first-page":"361","article-title":"Characterizing result errors in Internet desktop grids","author":"Kondo","year":"2007"},{"issue":"1","key":"10.1016\/j.tcs.2024.114631_br0080","article-title":"Reliable Internet-based computing in the presence of malicious workers","volume":"22","author":"Fern\u00e1ndez","year":"2012","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/j.tcs.2024.114631_br0090","series-title":"Proc. of the 20th International Symposium on Distributed Computing","first-page":"474","article-title":"Robust network supercomputing with malicious processes","author":"Konwar","year":"2006"},{"key":"10.1016\/j.tcs.2024.114631_br0100","series-title":"Proc. of the 22nd IEEE International Parallel & Distributed Processing Symposium","first-page":"1","article-title":"Distributed asymmetric verification in computational grids","author":"Kuhn","year":"2008"},{"key":"10.1016\/j.tcs.2024.114631_br0110","series-title":"Proc. of the 7th IEEE International Symposium on Network Computing and Applications","first-page":"315","article-title":"Designing mechanisms for reliable Internet-based computing","author":"Fern\u00e1ndez Anta","year":"2008"},{"issue":"3","key":"10.1016\/j.tcs.2024.114631_br0120","article-title":"Algorithmic mechanisms for reliable crowdsourcing computation under collusion","volume":"10","author":"Fern\u00e1ndez Anta","year":"2015"},{"key":"10.1016\/j.tcs.2024.114631_br0130","series-title":"Proc. of the 12th ACM Conference on Computer and Communications Security","first-page":"280","article-title":"On the cost-ineffectiveness of redundancy in commercial p2p computing","author":"Yurkewych","year":"2005"},{"key":"10.1016\/j.tcs.2024.114631_br0140","series-title":"Proc. of the 10th IEEE International Symposium on Network Computing and Applications","first-page":"275","article-title":"Algorithmic mechanisms for Internet supercomputing under unreliable communication","author":"Christoforou","year":"2011"},{"issue":"1","key":"10.1016\/j.tcs.2024.114631_br0150","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1109\/TC.2012.186","article-title":"Algorithmic mechanisms for reliable master-worker Internet-based computing","volume":"63","author":"Christoforou","year":"2014","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.tcs.2024.114631_br0160","series-title":"Proc. of the 24th IEEE International Parallel and Distributed Processing Symposium","first-page":"1","article-title":"Algorithmic mechanisms for Internet-based master-worker computing with untrusted and selfish workers","author":"Fern\u00e1ndez Anta","year":"2010"},{"key":"10.1016\/j.tcs.2024.114631_br0170","series-title":"Proc. of the 5th IEEE\/ACM International Workshop on Grid Computing","first-page":"4","article-title":"Boinc: a system for public-resource computing and storage","author":"Anderson","year":"2004"},{"key":"10.1016\/j.tcs.2024.114631_br0180","series-title":"Proc. of the Cryptographer's Track at RSA Conference 2001","first-page":"425","article-title":"Uncheatable distributed computations","author":"Golle","year":"2001"},{"key":"10.1016\/j.tcs.2024.114631_br0190","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10723-009-9131-6","article-title":"Computing low latency batches with unreliable workers in volunteer computing environments","volume":"7","author":"Heien","year":"2009","journal-title":"J. Grid Comput."},{"issue":"2","key":"10.1016\/j.tcs.2024.114631_br0200","doi-asserted-by":"crossref","DOI":"10.1145\/3158363","article-title":"Practical secure computation outsourcing: a survey","volume":"51","author":"Shan","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.tcs.2024.114631_br0210","series-title":"Proc. of the IEEE 35th Symposium on Reliable Distributed Systems","first-page":"31","article-title":"Multi-round master-worker computing: a repeated game approach","author":"Fern\u00e1ndez Anta","year":"2016"},{"issue":"1","key":"10.1016\/j.tcs.2024.114631_br0220","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01258206","article-title":"The folk theorem for finitely repeated games with mixed strategies","volume":"24","author":"Gossner","year":"1995","journal-title":"Int. J. Game Theory"},{"key":"10.1016\/j.tcs.2024.114631_br0230","series-title":"Modeling Bounded Rationality","author":"Rubinstein","year":"1998"},{"issue":"2","key":"10.1016\/j.tcs.2024.114631_br0240","first-page":"669","article-title":"Why bounded rationality?","volume":"34","author":"Conlisk","year":"1996","journal-title":"J. Econ. Lit."},{"key":"10.1016\/j.tcs.2024.114631_br0250","series-title":"Proceedings of the 7th Innovations in Theoretical Computer Science Conference (ITCS)","first-page":"237","article-title":"Rational proofs with multiple provers","author":"Chen","year":"2016"},{"key":"10.1016\/j.tcs.2024.114631_br0260","series-title":"Theory of Cryptography Conference","first-page":"319","article-title":"Rational sumchecks","author":"Guo","year":"2016"},{"key":"10.1016\/j.tcs.2024.114631_br0270","series-title":"Proceedings of the 5th Annual Conference on Innovations in Theoretical Computer Science (ITCS)","first-page":"523","article-title":"Rational arguments: single round delegation with sublinear verification","author":"Guo","year":"2014"},{"key":"10.1016\/j.tcs.2024.114631_br0280","series-title":"Proceedings of the 14th Annual ACM Conference on Electronic Commerce (EC)","first-page":"29","article-title":"Super-efficient rational proofs","author":"Azar","year":"2013"},{"key":"10.1016\/j.tcs.2024.114631_br0290","series-title":"International Symposium on Algorithmic Game Theory","first-page":"150","article-title":"Efficient rational proofs with strong utility-gap guarantees","author":"Chen","year":"2018"},{"key":"10.1016\/j.tcs.2024.114631_br0300","series-title":"27th Annual European Symposium on Algorithms (ESA 2019)","article-title":"Non-cooperative rational interactive proofs","author":"Chen","year":"2019"},{"key":"10.1016\/j.tcs.2024.114631_br0310","series-title":"Models of Strategic Rationality","first-page":"1","article-title":"Reexamination of the perfectness concept for equilibrium points in extensive games","author":"Bielefeld","year":"1988"},{"issue":"17","key":"10.1016\/j.tcs.2024.114631_br0320","doi-asserted-by":"crossref","first-page":"2363","DOI":"10.1002\/cpe.3104","article-title":"Applying the dynamics of evolution to achieve reliability in master-worker computing","volume":"25","author":"Christoforou","year":"2013","journal-title":"Concurr. Comput., Pract. Exp."},{"key":"10.1016\/j.tcs.2024.114631_br0330","series-title":"Proc. of the 20th ACM Symposium on Operating Systems Principles","first-page":"45","article-title":"Bar fault tolerance for cooperative services","author":"Aiyer","year":"2005"},{"key":"10.1016\/j.tcs.2024.114631_br0340","series-title":"Proc. of the 6th Workshop on Approximation and Online Algorithms","first-page":"119","article-title":"Malicious Bayesian congestion games","author":"Gairing","year":"2008"},{"key":"10.1016\/j.tcs.2024.114631_br0350","series-title":"Proc. of the 25th Annual ACM Symposium on Principles of Distributed Computing","first-page":"35","article-title":"When selfish meets evil: byzantine players in a virus inoculation game","author":"Moscibroda","year":"2006"},{"key":"10.1016\/j.tcs.2024.114631_br0360","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1111\/1467-937X.t01-1-00023","article-title":"Fault tolerant implementation","volume":"69","author":"Eliaz","year":"2002","journal-title":"Rev. Econ. Stud."},{"key":"10.1016\/j.tcs.2024.114631_br0370","series-title":"Proc. of the 25th Annual ACM Symposium on Principles of Distributed Computing","first-page":"53","article-title":"Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation","author":"Abraham","year":"2006"},{"key":"10.1016\/j.tcs.2024.114631_br0380","series-title":"Proc. of the 7th ACM Conference on Electronic Commerce","first-page":"18","article-title":"Combinatorial agency","author":"Babaioff","year":"2006"},{"key":"10.1016\/j.tcs.2024.114631_br0390","series-title":"Proc. of the 2nd International Workshop on Internet & Network Economics","first-page":"353","article-title":"Mixed strategies in combinatorial agency","author":"Babaioff","year":"2006"},{"key":"10.1016\/j.tcs.2024.114631_br0400","series-title":"Proc. of the International Conference on Game Theory for Networks","first-page":"374","article-title":"Combinatorial agency with audits","author":"Eidenbenz","year":"2009"},{"key":"10.1016\/j.tcs.2024.114631_br0410","series-title":"Proc. of the 2nd International Symposium on Algorithmic Game Theory","first-page":"109","article-title":"Free riding and free labor in combinatorial agency","volume":"vol. 5814","author":"Babaioff","year":"2009"},{"key":"10.1016\/j.tcs.2024.114631_br0420","series-title":"Proc. of the 6th USENIX Symposium on Operating Systems Design and Implementation","first-page":"191","article-title":"Bar gossip","author":"Li","year":"2006"},{"key":"10.1016\/j.tcs.2024.114631_br0430","series-title":"Proc. of the 8th USENIX Symposium on Operating Systems Design and Implementation","first-page":"355","article-title":"Flightpath: obedience vs choice in cooperative services","author":"Li","year":"2008"},{"key":"10.1016\/j.tcs.2024.114631_br0440","series-title":"International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness","first-page":"238","article-title":"Classification-based reputation mechanism for master-worker computing system","author":"Lu","year":"2017"},{"key":"10.1016\/j.tcs.2024.114631_br0450","series-title":"A Course in Game Theory","author":"Osborne","year":"1994"},{"key":"10.1016\/j.tcs.2024.114631_br0460","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.pmcj.2018.10.001","article-title":"Reputation-based multi-auditing algorithmic mechanism for reliable mobile crowdsensing","volume":"51","author":"Jin","year":"2018","journal-title":"Pervasive Mob. Comput."},{"key":"10.1016\/j.tcs.2024.114631_br0470","series-title":"Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security","first-page":"211","article-title":"Betrayal, distrust, and rationality: smart counter-collusion contracts for verifiable cloud computing","author":"Dong","year":"2017"},{"issue":"6","key":"10.1016\/j.tcs.2024.114631_br0480","doi-asserted-by":"crossref","first-page":"1293","DOI":"10.4149\/cai_2018_6_1293","article-title":"New methods of uncheatable grid computing","volume":"37","author":"Yu","year":"2019","journal-title":"Comput. Inform."},{"key":"10.1016\/j.tcs.2024.114631_br0490","doi-asserted-by":"crossref","first-page":"1778","DOI":"10.1109\/TIFS.2019.2949440","article-title":"Solving the crowdsourcing dilemma using the zero-determinant strategies","volume":"15","author":"Hu","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.tcs.2024.114631_br0500","series-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"Mitzenmacher","year":"2017"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397524002469?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397524002469?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,29]],"date-time":"2024-05-29T22:41:29Z","timestamp":1717022489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397524002469"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7]]},"references-count":49,"alternative-id":["S0304397524002469"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2024.114631","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2024,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Verifiable Crowd Computing: Coping with bounded rationality","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2024.114631","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"114631"}}