Verifiable crowd computing: coping with bounded rationality

DOI10.1016/J.TCS.2024.114631MaRDI QIDQ6558636zbMATH OpenFDO

Authors Lu Dong, Miguel A. Mosteiro, Shikha Singh

Publication date 19 June 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114631

zbMATH Keywords

repeated gamesalgorithmic game theoryInternet computingcrowd computingmaster-worker computingverifiable computation outsourcing

Mathematics Subject Classification ID

Applications of game theory (91A80) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Multistage and repeated games (91A20) Internet topics (68M11) Algorithmic game theory and complexity (91A68)

Recommendations

• Verifiable crowd computing: coping with bounded rationality
• Crowd computing as a cooperation problem: An evolutionary approach
• Outsourcing computation: the minimal refereed mechanism
• RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
• Rational proofs with multiple provers

Cites work

• scientific article; zbMATH DE number 1617943 (Why is no real title available?)
• scientific article; zbMATH DE number 7525466 (Why is no real title available?)
• A course in game theory.
• Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing
• Distributed computing meets game theory
• Efficient rational proofs with strong utility-gap guarantees
• Fault Tolerant Implementation
• Free-riding and free-labor in combinatorial agency
• Malicious Bayesian Congestion Games
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
• Rational arguments: single round delegation with sublinear verification
• Rational proofs with multiple provers
• Rational sumchecks
• Robust Network Supercomputing with Malicious Processes
• Sabotage-tolerance mechanisms for volunteer computing systems
• The folk theorem for finitely repeated games with mixed strategies
• Verifiable crowd computing: coping with bounded rationality
• When selfish meets evil, Byzantine players in a virus inoculation game

Cited in

(2)

• A game theoretic framework for distributed computing with dynamic set of agents
• Mathematical programming and machine learning for a task allocation game

This page was built for publication: Verifiable crowd computing: coping with bounded rationality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6558636)