Applying the dynamics of evolution to achieve reliability in master-worker computing

Concurrency and Computation: Practice and Experience

Volumn 25, Issue 17, 2013, Pages 2363-2380

  Christoforou, Evgenia ^a   Anta, Antonio Fernández ^a   Georgiou, Chryssis ^b   Mosteiro, Miguel A ^c,d   Sánchez, Angel ^e,f  

^a IMDEA NETWORKS INSTITUTE   (Spain)

^b UNIVERSITY OF CYPRUS   (Cyprus)

^c KEAN UNIVERSITY   (United States)

^d UNIVERSIDAD REY JUAN CARLOS   (Spain)

^e UNIVERSIDAD CARLOS III DE MADRID   (Spain)

^f UNIVERSITY OF ZARAGOZA   (Spain)

Author keywords

algorithmic mechanism design; evolutionary dynamics; Internet based computing; performing tasks; reinforcement learning

Indexed keywords

DYNAMICS; MACHINE DESIGN;

ALGORITHMIC MECHANISM DESIGN; CONVERGENCE TIME; DYNAMICS OF EVOLUTION; EVOLUTIONARY DYNAMICS; INTERNET BASED COMPUTING; MASTER PROCESS; MECHANISM-BASED; PERFORMING TASKS;

REINFORCEMENT LEARNING;

EID: 84886641354     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.3104     Document Type: Conference Paper

References (48)

1. Anderson D,. BOINC: a system for public-resource computing and storage. In proc. of GRID 2004; 4-10.
2. Korpela E, Werthimer D, Anderson D, Cobb J, Lebofsky M,. SETI@home: massively distributed computing for SETI. Computing in Science and Engineering 2001; 3 (1): 78-83. (Pubitemid 33674724)
3. Amazon's Mechanical Turk. https://www.mturk.com.
4. Golle P, Mironov I,. Uncheatable distributed computations. In proc. of CT-RSA 2001; 425-440.
5. Heien EM, Anderson DP, Hagihara K,. Computing low latency batches with unreliable workers in volunteer computing environments. Journal of Grid Computing 2009; 7: 501-518.
6. Abraham I, Dolev D, Goden R, Halpern JY,. Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In proc. of PODC 2006; 53-62.
7. Shneidman J, Parkes DC,. Rationality and self-interest in P2P networks. In Proc. of IPTPS 2003; 139-148.
8. Sarmenta L,. Sabotage-tolerance mechanisms for volunteer computing systems. Future Generation Computer Systems 2002; 18 (4): 561-572. (Pubitemid 34181832)
9. Fernández Anta A, Georgiou C, Mosteiro MA,. Designing mechanisms for reliable Internet-based computing. In proc. of NCA 2008; 315-324.
10. Fernández Anta A, Georgiou C, Mosteiro MA,. Algorithmic mechanisms for Internet-based master-worker computing with untrusted and selfish workers. In proc. of IPDPS 2010; 1-11.
11. Yurkewych M, Levine BN, Rosenberg AL,. On the cost-ineffectiveness of redundancy in commercial P2P computing. In proc. of CCS 2005; 280-288.
12. Bush RR, Mosteller F,. Stochastic Models for Learning. Wiley, 1955.
13. Szepesvári C,. Algorithms for Reinforcement Learning. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool publishers, 2010.
14. Bendor J, Mookherjee D, Ray D,. Aspiration-based reinforcement learning in repeated interaction games: an overview. International Game Theory Review 2001; 3 (2-3): 159-174.
15. Camerer CF,. Behavioral game theory: experiments in strategic interaction. Roundtable Series in Behavioral Economics 2003.
16. Easley D, Kleinberg J,. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010.
17. Gintis MC,. Game Theory Evolving. Princeton University Press, 2000.
18. Weibull JW,. Evolutionary Game Theory. MIT Press, 1995.
19. Halpern JY,. Computer science and game theory: a brief survey. Palgrave Dictionary of Economics 2007.
20. Abraham I, Alvisi L, Halpern J Y,. Distributed computing meets game theory: combining insights from two fields. ACM SIGACT News: Distributed Computing Column 2011; 42 (2): 69-76.
21. Nisan N, Roughgarden T, Tardos E, Vazirani VV,. Algorithmic Game Theory. Cambridge University Press, 2007.
22. Fernández A, Georgiou C, Lopez L, Santos A,. Reliably executing tasks in the presence of untrusted processors. In proc. of SRDS 2006; 39-50.
23. Konwar KM, Rajasekaran S, Shvartsman AA,. Robust network supercomputing with malicious processes. In proc. of DISC 2006; 474-488.
24. Christodoulou G, Koutsoupias E,. Mechanism design for scheduling. Bulletin of the EATCS 2009; 97: 39-59.
25. Nisan N, Ronen A,. Algorithmic mechanism design. Games and Economic Behavior 2001; 35: 166-196. (Pubitemid 33668164)
26. Nash JF,. Equilibrium points in n-person games. National Academy of Sciences 1950; 36 (1): 48-49.
27. Nowak MA,. Evolutionary Dynamics. Harvard University Press, 2006.
28. Maynard-Smith J,. Evolution and the Theory of Games. Cambridge University Press, 1982.
29. Maynard-Smith J, Price GR,. The logic of animal conflict. Nature 1973; 246: 15-18.
30. Henrich J, McElreath R,. The evolution of cultural evolution. Evolutionary Anthropology: Issues, News, and Reviews 12.3, 2003: 123-135.
31. Borgers T, Sarin R,. Learning through reinforcement and replicator dynamics. Journal of Economic Theory 1997; 77 (1): 1-14. (Pubitemid 127172745)
32. Samuelson L,. Evolutionary Games and Equilibrium Selection. MIT Press, 1998.
33. Bendor J, Mookherjee D, Ray D,. Reinforcement learning in repeated interaction games. Advances in Theoretical Economics 2001; 1 (1).
34. Laslier J, Topol R, Walliser B,. A behavioral learning process in games. Games and Economic Behavior 2001; 37: 340-366. (Pubitemid 33098328)
35. Izquierdo LR, Izquierdo SS,. Dynamics of the Bush-Mosteller learning algorithm in 2x2 games. Reinforcement Learning: Theory and Applications 2008.
36. Phelps S, McBurney P, Parsons S,. Evolutionary mechanism design: a review. Journal of Autonomous Agents and Multi-Agent Systems 2010.
37. Conitzer V, Sandholm T,. Incremental mechanism design. In Proc. IJCAI 2007.
38. Babaioff M, Feldman M, Nisan N,. Combinatorial agency. In proc. of ACM EC 2006; 18-28.
39. Babaioff M, Feldman M, Nisan N,. Mixed strategies in combinatorial agency. In proc. of WINE 2006; 353-364.
40. Eidenbenz R, Schmid S,. Combinatorial agency with audits. In proc. of GameNets 2009.
41. Babaioff M, Feldman M, Nisan N,. Free riding and free labor in combinatorial agency. In proc. of SAGT 2009.
42. Mass-Colell A, Whinton M, Green J,. Microeconomic Theory. Oxford University Press, 1995.
43. Rose D, Willemain TR,. The principal-agent problem with evolutionary learning. Computational and Mathematical Organization Theory 1996; 2: 139-162.
44. Taufer M, Anderson D, Cicotti P, Brooks CL,. Homogeneous redundancy: a technique to ensure integrity of molecular simulation results using public computing. In proc. of IPDPS 2005.
45. BOINC Security. http://boinc.berkeley.edu/wiki/BOINC-Security.
46. Einstein@home. http://einstein.phys.uwm.edu.
47. Estrada T, Taufer M, Anderson DP,. Performance prediction and analysis of BOINC projects: an empirical study with EmBOINC. Journal of Grid Computing 2009; 7 (4): 537-554.
48. WUProp@home. http://wuprop.boinc-af.org/.