Verifiable crowd computing: coping with bounded rationality

DOI10.1007/978-3-031-20796-9_5zbMath1528.68043OpenAlexW4313349156MaRDI QIDQ6166873

Lu Dong, Miguel A. Mosteiro, Shikha Singh

Publication date: 3 August 2023

Published in: Frontiers of Algorithmic Wisdom (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20796-9_5

zbMATH Keywords

repeated gamesalgorithmic game theoryInternet computingcrowd computingmaster-worker computingverifiable computation outsourcing

Mathematics Subject Classification ID

Applications of game theory (91A80) Multistage and repeated games (91A20) Internet topics (68M11) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial agency
• Efficient rational proofs with strong utility-gap guarantees
• The folk theorem for finitely repeated games with mixed strategies
• Rational Sumchecks
• Rational Proofs with Multiple Provers
• Rational arguments
• RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
• Robust Network Supercomputing with Malicious Processes
• Mixed Strategies in Combinatorial Agency
• Malicious Bayesian Congestion Games
• Free-Riding and Free-Labor in Combinatorial Agency
• Sabotage-tolerance mechanisms for volunteer computing systems
• Fault Tolerant Implementation
• When selfish meets evil
• Distributed computing meets game theory
• Algorithmic Mechanisms for Reliable Master-Worker Internet-Based Computing

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