IMDEA Networks Institute Publications Repository

Multi-round Master-Worker Computing: a Repeated Game Approach

Fernández Anta, Antonio and Georgiou, Chryssis and Mosteiro, Miguel A. and Pareja, Daniel (2016) Multi-round Master-Worker Computing: a Repeated Game Approach. In: The 35th Symposium on Reliable Distributed Systems (SRDS 2016), 26-29 September 2016, Budapest, Hungary.

[img] PDF (Multi-round Master-Worker Computing: a Repeated Game Approach) - Published Version
Download (457Kb)

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, exploiting that the repeated game model captures the effect of long-term interaction. That is, workers take into account that their behavior in one computation will have an effect on the behavior of other workers in the future. Indeed, should a worker be found to deviate from some agreed strategic choice, the remaining workers would change their own strategy to penalize the deviator. Hence, being rational, workers do not deviate. We identify analytically the parameter conditions to induce a desired worker behavior, and we evaluate experimentally the mechanisms derived from such conditions. We also compare the performance of our mechanisms with a previously known multiround mechanism based on reinforcement learning.

Item Type: Conference or Workshop Papers (Paper)
Uncontrolled Keywords: Internet Computing; Master-Worker Task Computing; Game Theory; Repeated Games; Algorithmic Mechanism Design.
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Antonio Fernandez
Date Deposited: 22 Jun 2016 11:53
Last Modified: 30 Nov 2016 11:58
URI: http://eprints.networks.imdea.org/id/eprint/1355

Actions (login required)

View Item View Item