Multi-round Master-Worker Computing: a Repeated Game Approach
Antonio Fern\'andez Anta, Chryssis Georgiou, Miguel A. Mosteiro, and, Daniel Pareja

TL;DR
This paper models multi-round master-worker computing as a repeated game, analyzing incentives and strategies to ensure reliable task completion through game-theoretic approaches and experimental evaluation.
Contribution
It introduces a game-theoretic framework for multi-round master-worker systems, deriving conditions for incentivizing truthful worker behavior and comparing mechanisms with reinforcement learning.
Findings
Workers are incentivized to cooperate under certain parameter conditions.
Repeated game modeling improves reliability of task results.
Mechanisms outperform reinforcement learning in specific scenarios.
Abstract
We consider a computing system where a master processor assigns tasks for execution to worker processors through the Internet. We model the workers decision of whether to comply (compute the task) or not (return a bogus result to save the computation cost) as a mixed extension of a strategic game among workers. That is, we assume that workers are rational in a game-theoretic sense, and that they randomize their strategic choice. Workers are assigned multiple tasks in subsequent rounds. We model the system as an infinitely repeated game of the mixed extension of the strategic game. In each round, the master decides stochastically whether to accept the answer of the majority or verify the answers received, at some cost. Incentives and/or penalties are applied to workers accordingly. Under the above framework, we study the conditions in which the master can reliably obtain tasks results,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
