Model checking coalition nash equilibria in MAD distributed systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5873 LNCS, Issue , 2009, Pages 531-546

  Mari, Federico ^a   Melatti, Igor ^a   Salvo, Ivano ^a   Tronci, Enrico ^a   Alvisi, Lorenzo ^b   Clement, Allen ^b   Li, Harry ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED SYSTEMS; EXPLICIT ALGORITHMS; FINITE STATE; MALICIOUS NODES; MODEL CHECKER; MODEL CHECKING ALGORITHM; NASH EQUILIBRIA; NASH EQUILIBRIUM; NORMAL FORM;

ALGORITHMS; MATHEMATICAL MODELS; NETWORK SECURITY; STABILIZATION; TELECOMMUNICATION NETWORKS;

MODEL CHECKING;

EID: 70549111612     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05118-0_37     Document Type: Conference Paper

References (23)

1. Aiyer, A.S., Alvisi, L., Clement, A., Dahlin, M., Martin, J.-P., Porth, C.: Bar fault tolerance for cooperative services. In: Proc. of SOSP 2005, pp. 45-58. ACM Press, New York (2005)
2. Batten, C., Barr, K., Saraf, A., Trepetin, S.: pStore: A secure peer-to-peer backup system. Technical Memo MIT-LCS-TM-632, Massachusetts Institute of Technology Laboratory for Computer Science (October 2002)
3. Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers C-35(8), 677-691 (1986)
4. Buttyán, L., Hubaux, J.-P.: Security and Cooperation in Wireless Networks Thwarting Malicious and Selfish Behavior in the Age of Ubiquitous Computing (version 1.5). Cambridge University Press, Cambridge (2007)
5. Chien, S., Sinclair, A.: Convergence to approximate nash equilibria in congestion games. In: Proc. of SODA 2007, pp. 169-178 (2007)
6. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge (1999)
7. Clement, A., Li, H., Napper, J., Martin, J.-P., Alvisi, L., Dahlin, M.: BAR primer. In: Proc. of DSN 2008 (2008)
8. Cohen, B.: Incentives build robustness in bittorrent. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)
9. Cox, L.P., Noble, B.D.: Samsara: honor among thieves in peer-to-peer storage. In: Proc. of SOSP 2003, pp. 120-132. ACM, New York (2003)
10. CUDD Web Page (2004), http://vlsi.colorado.edu/~fabio/
11. Eliaz, K.: Fault tolerant implementation. Review of Economic Studies 69(3), 589-610 (2002)
12. Everett, H.: Recursive games. Contributions to the theory of games. Annals of Mathematical Studies, vol. III, p. 39 (1957)
13. Feigenbaum, J., Sami, R., Shenker, S.: Mechanism design for policy routing. In: Proc. of PODC 2004, pp. 11-20. ACM, New York (2004)
14. Fudenberg, D., Tirole, J.: Game theory. MIT Press, Cambridge (1991)
15. Hayrapetyan, A., Tardos, É., Wexler, T.: The effect of collusion in congestion games. In: Proc. of STOC 2006, pp. 89-98. ACM, New York (2006)
16. Li, H., Clement, A., Wong, E., Napper, J., Roy, I., Alvisi, L., Dahlin, M.: BAR gossip. In: Proc. of OSDI 2006 (2006)
17. Lillibridge, M., Elnikety, S., Birrell, A., Burrows, M., Isard, M.: A cooperative internet backup scheme. In: Proc. of ATEC 2003, p. 3. USENIX Association (2003)
18. Mahajan, R., Rodrig, M., Wetherall, D., Zahorjan, J.: Sustaining cooperation in multi-hop wireless networks. In: Proc. of NSDI 2005, pp. 231-244. USENIX Association (2005)
19. Maniatis, P., Rosenthal, D.S.H., Roussopoulos, M., Baker, M., Giuli, T.J., Muliadi, Y.: Preserving peer replicas by rate-limited sampled voting. In: Proc. SOSP 2003, pp. 44-59. ACM, New York (2003)
20. Mari, F., Melatti, I., Salvo, I., Tronci, E., Alvisi, L., Clement, A., Li, H.: Model checking nash equilibria in mad distributed system. In: Cimatti, A., Jones, R.B. (eds.) Proc. of FMCAD 2008, pp. 85-92. IEEE, Los Alamitos (2008)
21. Nisan, N., Ronen, A.: Algorithmic mechanism design (extended abstract). In: Proc. of STOC 1999, pp. 129-140. ACM, New York (1999)
22. NuSMV Web Page (2006), http://nusmv.irst.itc.it/
23. Shneidman, J., Parkes, D.C.: Specification faithfulness in networks with rational nodes. In: Proc. of PODC 2004, pp. 88-97. ACM, New York (2004)