Game authority for robust and scalable distributed selfish-computer systems

Abraham, 2008, Lower bounds on implementing robust and resilient mediators, vol. 4948, 302 Aiyer, 2005, Bar fault tolerance for cooperative services, SIGOPS Oper. Syst. Rev., 39, 45, 10.1145/1095809.1095816 Anshelevich, 2004, The price of stability for network design with fair cost allocation, 295 Blum, 1983, Coin flipping by telephone a protocol for solving impossible problems, SIGACT News, 15, 23, 10.1145/1008908.1008911 Cagalj, 2005, On selfish behavior in csma/ca networks, 2513 Clement, 2007, Theory of bar games, 358 Dijkstra, 1974, Self-stabilizing systems in spite of distributed control, Commun. ACM, 17, 643, 10.1145/361179.361202 Dolev, 2000 S. Dolev, E.M. Schiller, P.G. Spirakis, P. Tsigas, Brief announcement: Game authority for robust and scalable distributed selfish-computer systems, in: PODC’07, 2007, p. 356. S. Dolev, E.M. Schiller, P.G. Spirakis, P. Tsigas, Strategies for repeated games with subsystem takeovers implantable by deterministic and self-stabilizing automata. Tech. Rep. 2008:11, Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, April 2008. Dolev, 2004, Self-stabilizing clock synchronization in the presence of byzantine faults, J. ACM, 51, 780, 10.1145/1017460.1017463 Shlomi Dolev, Elad M. Schiller, Paul G. Spirakis, Game authority: For robust distributed selfish-computer systems, Tech. rep., DELIS, 2006. Accessible via http://delis.upb.de/docs/. Shlomi Dolev, Elad M. Schiller, Paul G. Spirakis, Game authority: For robust distributed selfish-computer systems, Tech. rep., Department of Computer Science and Engineering, Chalmers University of Technology and Göteborg University, March 2006. Elkind, 2005, Hybrid voting protocols and hardness of manipulation., vol. 3827, 206 J. Feigenbaum, S. Shenker, Distributed algorithmic mechanism design: Recent results and future directions, in: DIALM ’02: Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, 2002, pp. 1–13. Garay, 1998, Fully polynomial byzantine agreement for processors in rounds, SIAM J. Comput., 27, 247, 10.1137/S0097539794265232 Koutsoupias, 1999, Worst-case equilibria, vol. 1563, 404 Koutsoupias, 2009, Worst-case equilibria, Comput. Sci. Rev., 3, 65, 10.1016/j.cosrev.2009.04.003 Lamport, 1982, The byzantine generals problem, ACM Trans. Program. Lang. Syst., 4, 382, 10.1145/357172.357176 T.F. Lunt, Automated audit trail analysis and intrusion detection: A survey, in: Proceedings of the 11th National Computer Security Conference, 1988, pp. 65–73. URL: http://www.csl.sri.com/papers/survey88/. Moscibroda, 2006, When selfish meets evil: Byzantine players in a virus inoculation game, 35 Nash, 1950, Equilibrium points in n-person games, Proc. National Academy of Sciences of USA, 36, 48, 10.1073/pnas.36.1.48 Osborne, 1994