A., Agah, S. K., Das, K., Basu, and M., Asadi, “Intrusion detection in sensor networks: A noncooperative game approach,” in Proc. 3rd Intl Symp. on Network Computing and Applications (NCA). Washington, DC, USA: IEEE Computer Society, 2004, pp. 343–346.
S., Agarwal, “Ranking on graph data,” in Proc. Intl Conf. on Machine Learning, ICML, 2006, pp. 25–32.
B. H., Ahn, “Solution of nonsymmetric linear complementarity problems by iterative methods,” J. Optimization Theor. Applic., 33, 185–197, 1981.
T., Alpcan, “Noncooperative games for control of networked systems,” PhD dissertation, University of Illinois at Urbana-Champaign, Urbana, IL, May 2006.
T., Alpcan and T., Başar, “A game theoretic approach to decision and analysis in network intrusion detection,” in Proc. 42nd IEEE Conf. on Decision and Control (CDC), Maui, HI, Dec. 2003, pp. 2595–2600.
T., Alpcan, “A game theoretic analysis of intrusion detection in access control systems,” in Proc. 43rd IEEE Conf. on Decision and Control (CDC), Paradise Island, Bahamas, Dec. 2004, pp. 1568–1573.
T., Alpcan, “Distributed algorithms for Nash equilibria of flow control games,” in Advances in Dynamic Games: Applications to Economics, Finance, Optimization, and Stochastic Control, ser. Annals of Dynamic Games. Boston, MA: Birkhauser, 2005, vol. 7, pp. 473–498.
T., Alpcan, “An intrusion detection game with limited observations,” in 12th Intl Symp. on Dynamic Games and Applications, Sophia Antipolis, France, July 2006.
T., Alpcan and N., Bambos, “Modeling dependencies in security risk management,” in Proc. 4th Intl Conf. on Risks and Security of Internet and Systems (CRISIS), Toulouse, France, Oct. 2009.
T., Alpcan, T., Başar, R., Srikant, and E., Altman, “CDMA uplink power control as a noncooperative game,” Wireless Networks, 8(6), 659–670, Nov. 2002.
T., Alpcan and C., Bauckhage, “A discrete-time parallel update algorithm for distributed learning,” in Proc. 19th Intl Conf. on Pattern Recognition (ICPR), Tampa, FL, USA, Dec. 2008.
T., Alpcan, “A distributed machine learning framework,” in Proc. 48th IEEE Conf. on Decision and Control (CDC), Shanghai, China, Dec. 2009.
T., Alpcan, C., Bauckhage, and A.-D., Schmidt, “A probabilistic diffusion scheme for anomaly detection on smartphones,” in Proc. Workshop on Information Security Theory and Practices (WISTP), Passau, Germany, April 2010.
T., Alpcan and S., Buchegger, “Security games for vehicular networks,” IEEE Trans. Mob. Comput. (to appear).
T., Alpcan, X., Fan, T., Başar, M., Arcak, and J. T., Wen, “Power control for multicell CDMA wireless networks: A team optimization approach,” Wireless Networks, 14(5), 647–657, Oct. 2008.
T., Alpcan and X., Liu, “A game theoretic recommendation system for security alert dissemination,” in Proc. IEEE/IFIP Intl Conf. on Network and Service Security (N2S 2009), Paris, France, June 2009.
T., Alpcan, C., Orencik, A., Levi, and E., Savas, “A game theoretic model for digital identity and trust in online communities,” in Proc. 5th ACM Symp. on Information, Computer and Communications Security (ASIACCS), April 2010.
T., Alpcan and L., Pavel, “Nash equilibrium design and optimization,” in Proc. Intl Conf. on Game Theory for Networks (GameNets), Istanbul, Turkey, May 2009.
T., Alpcan, L., Pavel, and N., Stefanovic, “A control theoretic approach to noncooperative game design,” in Proc. 48th IEEE Conf. on Decision and Control (CDC), Shanghai, China, December 2009.
T., Alpcan, N., Shimkin, and L., Wynter, “International Workshop on Game Theory in Communication Networks (GameComm),” October 2008. [Online]. Available: http://www.game-comm.org
E., Altman and T., Başar, “Multiuser rate-based flow control,” IEEE Trans. Commun., 46(7), 940–949, July 1998.
B. D. O., Anderson and J. B., Moore, Optimal Control: Linear Quadratic Methods. Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1990.
R. J., Anderson, Security Engineering: A Guide to Building Dependable Distributed Systems, 2nd edn. Indianapolis, IN, USA: Wiley Publishing, 2008.
S., Axelsson, “The base-rate fallacy and its implications for the difficulty of intrusion detection,” in Proc. 6th ACM Conf. on Computer and Communications Security (CCS), Kent Ridge Digital Labs, Singapore, 1999, pp. 1–7.
R. G., Bace, Intrusion Detection. Indianapolis, IN, USA: Macmillan Technical Publishing, 2000.
R. G., Bace and P., Mell, “Intrusion detection systems,” NIST Special Publication on Intrusion Detection Systems, Nov. 2001. [Online]. Available: http://www.snort.org/docs/nist-ids.pdf
T., Başar, “Relaxation techniques and asynchronous algorithms for on-line computation of noncooperative equilibria,” J. Econ. Dyn. Control, 11(4), 531–549, Dec. 1987.
T., Başar, “International Conference on Game Theory for Networks (GameNets),” May 2009. [Online]. Available: http://www.gamenets.org
T., Başar and P., Bernhard, H∞-Optimal Control and Related Minimax Design Problems: A Dynamic Game Approach, 2nd edn. Boston, MA: Birkhäuser, 1995.
T., Başar and S., Li, “Distributed computation of nash equilibria in linear-quadratic stochastic differential games,” SIAM J. Control Optim., 27(3), 563–578, 1989.
T., Başar and G. J., Olsder, Dynamic Noncooperative Game Theory, 2nd edn. Philadelphia, PA: SIAM, 1999.
C., Bauckhage, “Image tagging using pagerank over bipartite graphs,” in LNCS: Pattern Recognition, G., Rigoll, ed. Berlin/Heidelberg: Springer, 2008, vol. 5096/2008.
A., Beresford and F., Stajano, “Mix zones: User privacy in location-aware services,” in Proc. 2nd IEEE Conference on Pervasive Computing and Communications Workshops, 2004, March 2004, pp. 127–131.
U., Berger, “Fictitious play in 2xn games,” J. Econ. Theor., 120(2), 139–154, 2005.
D., Bertsekas, Nonlinear Programming, 2nd edn. Belmont, MA: Athena Scientific, 1999.
D., Bertsekas, Dynamic Programming and Optimal Control, 3rd edn. Belmont, MA: Athena Scientific, 2007, vol. 2.
D., Bertsekas and R., Gallager, Data Networks. 2nd edn. Upper Saddle River, NJ: Prentice Hall, 1992.
D., Bertsekas and J. N., Tsitsiklis, Parallel and Distributed Computation: Numerical Methods. Upper Saddle River, NJ: Prentice Hall, 1989.
I., Bilogrevic, M. H., Manshaei, M., Raya, and J.-P., Hubaux, “Optimal revocations in ephemeral networks: A game-theoretic framework,” in Proc. of 8th Intl. Symp. on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt), Avignon, France, May 2010.
C. M., Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics). Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2006.
M., Bloem, T., Alpcan, and T., Başar, “Intrusion response as a resource allocation problem,” in Proc. 45th IEEE Conf. on Decision and Control (CDC), San Diego, CA, Dec. 2006, pp. 6283–6288.
M., Bloem, “Optimal and robust epidemic response for multiple networks,” in Proc. 46th IEEE Conf. on Decision and Control (CDC), New Orleans, LA, Dec. 2007.
M., Bloem, “An optimal control approach to malware filtering,” in Proc. 46th IEEE Conf. on Decision and Control (CDC), New Orleans, LA, Dec. 2007.
M., Bloem, “Optimal and robust epidemic response for multiple networks,” IFAC Control Eng Practice (to appear).
M., Bloem, T., Alpcan, S., Schmidt, and T., Başar, “Malware filtering for network security using weighted optimality measures,” in Proc. IEEE Conf. on Control Applications (CCA), Singapore, Oct. 2007.
S., Buchegger and T., Alpcan, “Security games for vehicular networks,” in Proc. Allerton Conf. on Communication, Control, and Computing, Urbana-Champaign, IL, USA, Sept. 2008.
S., Buchegger and J.-Y., Le Boudee, “Self-policing mobile ad hoc networks by reputation systems,” IEEE Commun. Mag., 43(7), 101–107, July 2005.
S., Buchegger, C., Tissieres, and J., Le Boudec, “A test-bed for misbehavior detection in mobile ad-hoc networks – how much can watchdogs really do?” in Proc. 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), Dec. 2004, pp. 102–111.
L., Buttyan, T., Holczer, and I., Vajda, “On the effectiveness of changing pseudonyms to provide location privacy in VANETs,” in Proc. 4th European Workshop on Security and Privacy in Ad Hoc and Sensor Networks (ESAS), 2007.
L., Buttyan and J.-P., Hubaux, Security and Cooperation in Wireless Networks. Cambridge, UK: Cambridge University Press, 2008. [Online]. Available: http://secowinet.epfl.ch
R., Bye, S., Schmidt, K., Luther, and S., Albayrak, “Application-level simulation for network security,” in Proc. 1st Intl Conf. on Simulation Tools and Techniques (Simutools). Marseille, France: ICST, March 2008, pp. 1–10.
G. R., Cantieni, G., Iannaccone, C., Barakat, C., Diot, and P., Thiran, “Reformulating the monitor placement problem: Optimal network-wide sampling,” in Proc. 2nd Conf. on Future Networking Technologies (CoNeXT), Lisbon, Portugal, Dec. 2006.
J.-F., Chamberland and V. V., Veeravalli, “Asymptotic results for decentralized detection in power constrained wireless sensor networks,” IEEE J. Sel. Areas in Commun., 22(6), 1007–1015, Aug. 2004.
J.-F., Chamberland, “How dense should a sensor network be for detection with correlated observations?” IEEE Trans. Inf. Theor., 52(11), 5099–5106, 2006.
H., Chan, V. D., Gligor, A., Perrig, and G., Muralidharan, “On the distribution and revocation of cryptographic keys in sensor networks,” IEEE Trans. Dependable Secure Comput., 2(3), 233–247, 2005.
L., Chen, “On selfish and malicious behaviors in wireless networks – a noncooperative game theoretic approach,” PhD dissertation, TELECOM ParisTech, 2008.
T. M., Chen and N., Jamil, “Effectiveness of quarantine in worm epidemics,” in Proc. IEEE Conf. on Communication (ICC), Istanbul, Turkey, June 2006, pp. 2142–2147.
L., Cranor and S., Garfinkel, Security and Usability: Designing Secure Systems that People Can Use. Sebastopol, CA: O'Reilly Media Inc., 2005.
A. A., Daoud, T., Alpcan, S., Agarwal, and M., Alanyali, “A stackelberg game for pricing uplink power in wide-band cognitive radio networks,” in Proc. 47th IEEE Conf. on Decision and Control (CDC), Cancun, Mexico, Dec. 2008.
N., Eagle and A. S., Pentland, “Reality mining: Sensing complex social systems,” Personal Ubiquitous Comput., 10(4), 255–268, 2006.
R., Ellison, D., Fisher, R., Linger, H., Lipson, T., Longstaff, and N., Mead, “Survivable Network Systems: An Emerging Discipline,” Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA, USA, Tech. Rep., Nov. 1997.
R., Ellison, R., Linger, H., Lipson, N., Mead, and A., Moore, “Foundations for survivable systems engineering,” J. Defense Software Eng. pp. 10–15, July 2002.
J. C., Ely, D., Fudenberg, and D. K., Levine, “When is Reputation Bad?” SSRN eLibrary, 2004.
M., Felegyhazi, J.-P., Hubaux, and L., Buttyan, “Nash equilibria of packet forwarding strategies in wireless ad hoc networks,” IEEE Trans. Mob. Comput, 5(5), 463–476, 2006.
J., Freudiger, M. H., Manshaei, J. L., Boudec, and J. P., Hubaux, “On the age of pseudonyms in mobile ad hoc networks,” in Proc. 29th IEEE Conf. on Computer Communications (Infocom), San Diego, CA, USA, March 2010.
J., Freudiger, M. H., Manshaei, J.-P., Hubaux, and D. C., Parkes, “On noncooperative location privacy: A game-theoretic analysis,” in Proc. 16th ACM Conf. on Computer and Communications Security (CCS), New York, NY, USA: ACM, 2009, pp. 324–337.
D., Fudenberg and J., Tirole, Game Theory. Cambridge, MA, USA: MIT Press, 1991.
P. R., Garvey, Analytical Methods for Risk Management: A Systems Engineering Perspective, ser. Statistics: A Series of Textbooks and Monographs. Boca Raton, FL, USA: Chapman and Hall/CRC, 2009.
P. D., Groom, “The It security model,” IEEE Potentials, 22(4), 6–8, Oct./Nov. 2003.
J., Grossklags and B., Johnson, “Uncertainty in the weakest-link security game,” in Proc. Intl Conf. on Game Theory for Networks (GameNets), May 2009, pp. 673–682.
J., Grossklags, N., Christin, and J., Chuang, “Secure or insure?: A game-theoretic analysis of information security games,” in Proc. 17th Intl Conf. on World Wide Web (WWW). New York, NY, USA: ACM, 2008, pp. 209–218.
J. Y., Halpern and R., Pass, “Iterated regret minimization: A more realistic solution concept,” in Proc. 21st Intl Joint Conf. on Artificial Intelligence (IJCAI), Pasadena, CA, USA, July 2009.
Z., Han, N., Marina, M., Debbah, and A., Hjørungnes, “Physical layer security game: How to date a girl with her boyfriend on the same table,” in Proc. Intl Conf. on Game Theory for Networks (GameNets), May 2009, pp. 287–294.
C., Herley, “So long, and no thanks for the externalities: The rational rejection of security advice by users,” in Proc. 2009 Workshop on New Security Paradigms (NSPW). New York, NY, USA: ACM, 2009, pp. 133–144.
H. W., Hethcote, “The mathematics of infectious diseases,” SIAM Rev., 42(4), 599–653, 2000.
T. K., Ho and E. M., Kleinberg, “Building projectable classifiers of arbitrary complexity,” in Proc. 13th Intl Conf. on Pattern Recognition (ICPR). Washington, DC, USA: IEEE Computer Society, 1996, p. 880.
I. Y., Hoballah and P. K., Varshney, “Distributed Bayesian signal detection,” IEEE Trans. Inf. Theor., 35(5), 995–1000, Sept. 1989.
R., Horn and C., Johnson, Matrix Analysis. New York, NY: Cambridge University Press, 1985.
L., Huang, K., Matsuura, H., Yamane, and K., Sezaki, “Enhancing wireless location privacy using silent period,” in Proc. IEEE Wireless Communications and Networking Conf. (WCNC), New Orleans, LA, USA, March 2005, vol. 2, pp. 1187–1192.
P. J., Huber, “A robust version of the probability ratio test,” Ann. Math. Statist., 36, 1753–1758, 1965.
R., Isaacs, Differential Games: A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization, ser. Dover Books on Mathematics. New York: Courier Dover Publications, 1999 (1965).
A., Josang, R., Ismail, and C., Boyd, “A survey of trust and reputation systems for online service provision,” Decision Support Systs, 43(2), 618–644, 2007.
T., Kailath, Linear Systems. Upper Saddle River, NJ, USA: Prentice Hall, 1980.
F., Kargl, P., Papadimitratos, L., Buttyan, M., Muter, E., Schoch, B., Wiedersheim, T., Ta-Vinh, G., Calandriello, A., Held, A., Kung, and J.-P., Hubaux, “Secure vehicular communication systems: implementation, performance, and research challenges,” IEEE Commun. Mag., 46(11), 110–118, November 2008.
H., Kashima, K., Tsuda, and A., Inokuchi, “Kernels for graphs,” in Kernel Methods in Computational Biology, B., Schölkopf, K., Tsuda, and J.-P., Vert, eds. Cambridge, MA, USA: MIT Press, 2004, pp. 155–170.
A., Kashyap, T., Başar, and R., Srikant, “Correlated jamming on MIMO Gaussian fading channels,” IEEE Trans. Inf. Theory, 50(9), 2119–2123, Sept. 2004.
A., Kashyap, “Asymptotically optimal quantization for detection in power constrained decentralized networks,” in Proc. 2006 American Control Conf. (ACC), Minneapolis, MN, USA, June 2006, pp. 14–16.
M., Kodialam and T. V., Lakshman, “Detecting network intrusions via sampling: A game theoretic approach,” in Proc. 22nd IEEE Conf. on Computer Communications (Infocom), San Fransisco, CA, April 2003, vol. 3, pp. 1880–1889.
O., Kreidl and T., Frazier, “Feedback control applied to survivability: A host-based autonomic defense system,” IEEE Trans. Reliability, 53(1), 148–166, March 2004.
J. F., Kurose and K. W., Ross, Computer Networking: A Top-Down Approach, 5th ed. USA: Addison-Wesley, 2009.
M. G., Lagoudakis and R., Parr, “Value function approximation in zero sum Markov games,” in Proc. 18th Conf. on Uncertainty in Artificial Intelligence (UAI). Morgan Kaufmann, 2002, pp. 283–292.
T. L., Lai, “Sequential analysis: some classical problems and new challenges,” Statistica Sinica, 11, 303–408, 2001.
A., Langville and C., Meyer, “A survey of eigenvector methods for Web information retrieval,” SIAM Rev., 47(1), 135–161, 2005.
S., Leyffer, “The return of the active set method,” Oberwolfach Reports, 2(1), 2005.
K., Leyton-Brown and Y., Shoham, Essentials of Game Theory: A Concise, Multidisciplinary Introduction, ser. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan Claypool Publishers, 2008.
M., Li, K., Sampigethaya, L., Huang, and R., Poovendran, “Swing & swap: User centric approaches towards maximizing location privacy,” in Workshop on Privacy in the Electronic Society (WPES), 2006.
S., Li and T., Başar, “Distributed algorithms for the computation of noncooperative equilibria,” Automatica, 23(4), 523–533, 1987.
M. L., Littman, “Markov games as a framework for multi-agent reinforcement learning,” in Proc. 11th Intl Conf. on Machine Learning (ICML), San Francisco, CA, 1994, pp. 157–163.
Y., Liu, C., Comaniciu, and H., Man, “A Bayesian game approach for intrusion detection in wireless ad hoc networks,” in Proc. 2006 Workshop on Game Theory for Communications and Networks (GameNets'06). New York, NY, USA: ACM, Oct. 2006, p. 4.
D. G., Luenberger, Linear and Nonlinear Programming, 2nd edn. Reading, MA: Addison-Wesley, 1984.
D. G., Luenberger, Optimization by Vector Space Methods, ser. Series in Decision and Control. New York, NY, USA: John Wiley & Sons, Inc., 1997.
R., Mallik, R., Scholtz, and G., Papavassilopoulos, “Analysis of an on–off jamming situation as a dynamic game,” IEEE Trans. Commun., 48(8), 1360–1373, Aug. 2000.
M. A., Maloof, ed., Machine Learning and Data Mining for Computer Security, ser. Advanced Information and Knowledge Processing. London, UK: Springer London.
N., Mandayam, G., Editor, S., Wicker, J., Walrand, T., Başar, J., Huang, and D., Palomar, “Game theory in communication systems,” IEEE J. Selected Areas in Commun. (JSAC), 26(7), 1042–1046, Sept. 2008.
W., Mao, X., Su, and X., Xu, “Comments on “correlated jamming on MIMO Gaussian fading channels”,” IEEE Trans. Inf. Theor., 52(11), 5163–5165, Nov. 2006.
I., Maros, “A general pricing scheme for the simplex method,” Ann. Oper. Res., 124(1–4), 193–203, 2004.
L., Mastroleon, “Scalable resource control in large-scale computing/networking infrastructures,” PhD dissertation, Stanford University, Palo Alto, CA, USA, July 2009.
M., Mavronicolas, V. G., Papadopoulou, A., Philippou, and P. G., Spirakis, “A graph-theoretic network security game,” Intl J. Auton. Adapt. Commun. Syst., 1(4), 390–410, 2008.
D., Meier, Y. A., Oswald, S., Schmid, and R., Wattenhofer, “On the windfall of friendship: Inoculation strategies on social networks,” in Proc. 9th ACM Conf. on Electronic Commerce (EC). New York, NY, USA: ACM, 2008, pp. 294–301.
A. J., Menezes, P. C., van Oorschot, and S. A., Vanstone, Handbook of Applied Cryptography, ser. Discrete Mathematics and Its Applications. Boca Raton, FL: CRC Press, 1996. [Online]. Available: http://www.cacr.math.uwaterloo.ca/hac
R. A., Miura-Ko and N., Bambos, “Dynamic risk mitigation in computing infrastructures,” in Proc. 3rd Intl Symp. on Information Assurance and Security. IEEE, 2007, pp. 325–328.
R. A., Miura-Ko, “Securerank: A risk-based vulnerability management scheme for computing infrastructures.” in Proc. IEEE Conf. on Communication (ICC). IEEE, 2007, pp. 1455–1460.
R. A., Miura-Ko, B., Yolken, N., Bambos, and J., Mitchell, “Security investment games of interdependent organizations,” in 46th Annual Allerton Conf., Sept. 2008.
R. A., Miura-Ko, B., Yolken, J., Mitchell, and N., Bambos, “Security decision-making among inter-dependent organizations,” in Proc. 21st IEEE Computer Security Foundations Symp. (CSF), June 2008, pp. 66–80.
D., Moore, C., Shannon, and K., Claffy, “Code-Red: A case study on the spread and victims of an Internet worm,” in Proc. ACM SIGCOMM Workshop on Internet Measurement, Marseille, France, 2002, pp. 273–284.
D., Moore, C., Shannon, G., Voelker, and S., Savage, “Internet quarantine: Requirements for containing self-propagating code,” in Proc. 22nd IEEE Conf. on Computer Communications (Infocom), April 2003, vol. 3, pp. 1901–1910.
T., Moore, J., Clulow, S., Nagaraja, and R., Anderson, “New strategies for revocation in ad-hoc networks,” in Proc. 4th Euro. Workshop on Security and Privacy in Ad Hoc and Sensor Networks (ESAS), Cambridge, England, July 2007, pp. 232–246.
R., Morselli, J., Katz, and B., Bhattacharjee, “A game-theoretic framework for analyzing trust-inference protocols,” in Proc. 2nd Workshop on the Economics of Peer-to-Peer Systems, Cambridge, MA, USA, June 2004.
T., Moscibroda, S., Schmid, and R., Wattenhofer, “When selfish meets evil: Byzantine players in a virus inoculation game,” in Proc. 25th ACM Symp. on Principles of Distributed Computing (PODC). New York, NY, USA: ACM, Aug. 2006, pp. 35–44.
P., Moulin, ECE561 – Signal Detection and Estimation Lecture Notes. Urbana-Champaign, IL, USA: University of Illinois at Urbana-Champaign, 2008.
J., Mounzer, T., Alpcan, and N., Bambos, “Dynamic control and mitigation of interdependent IT security risks,” in Proc. IEEE Conf. on Communication (ICC). IEEE Communications Society, May 2010.
D. R., Musicant and A., Feinberg, “Active set support vector regression,” IEEE Trans. Neural Networks, 15(2), 268–275, March 2004.
R. B., Myerson, Game Theory, Analysis of Conflict. Cambridge, MA, USA: Harvard University Press, Sept. 1991.
J. F., Nash, “Equilibrium points in n-person games,” Proc. Nat. Acad. Sci. USA, 36(1), 48–49, Jan. 1950. [Online]. Available: http://www.jstor.org/stable/88031
J. F., Nash, “Noncooperative games,” Ann. Math., 54(2), 286–295, Sept. 1951. [Online]. Available: http://www.jstor.org/stable/1969529
K. C., Nguyen, T., Alpcan, and T., Başar, “A decentralized Bayesian attack detection algorithm for network security,” in Proc. 23rd Intl Information Security Conf. (SEC 2008), Milan, Italy, Sept. 2008.
K. C., Nguyen, “Distributed hypothesis testing with a fusion center: The conditionally dependent case,” in Proc. 47th IEEE Conf. on Decision and Control (CDC), Cancun, Mexico, Dec. 2008.
K. C., Nguyen, “Security games with incomplete information,” in Proc. IEEE Conf. Commun. (ICC), Dresden, Germany, June 2009.
K. C., Nguyen, “Stochastic games for security in networks with interdependent nodes,” in Proc. Intl Conf. on Game Theory for Networks (GameNets), Istanbul, Turkey, May 2009.
K. C., Nguyen, “Fictitious play with time-invariant frequency update for network security,” in Proc. IEEE Multi-Conference on Systems and Control (MSC) and IEEE CCA, Yokohama, Japan, September 2010.
J., Nielsen, Usability Engineering. San Francisco, CA, USA: Morgan Kaufmann, 1994.
N., Nisan, T., Roughgarden, E., Tardos, and V. V., Vazirani, Algorithmic Game Theory. New York, NY, USA: Cambridge University Press, 2007.
P., Nurmi, “A Bayesian framework for online reputation systems,” in Proc. Advd Intl Conf. on Telecommunications and Intl Conf. on Internet and Web Applications and Services (AICT-ICIW). Washington, DC, USA: IEEE Computer Society, 2006, p. 121.
K., Ogata, Modern Control Engineering, 4th edn. Upper Saddle River, NJ: Prentice Hall, 2002.
M. J., Osborne and A., Rubinstein, A Course in Game Theory, ser. MIT Press Books. Cambridge, MA, USA: MIT Press, Dec. 1994, vol. 1, no.
G., Owen, Game Theory, 3rd edn. New York, NY: Academic Press, 2001.
L., Pontryagin, V., Boltyanskii, R., Gamkrelidze, and E., Mishchenko, The Mathematical Theory of Optimal Processes. New York, NY, USA: Interscience Publishers, 1962.
V. H., Poor, An Introduction to Signal Detection and Estimation, 2nd edn. New York, NY, USA: Springer-Verlag, 1994.
S., Radosavac, J. S., Baras, and I., Koutsopoulos, “A framework for MAC protocol misbehavior detection in wireless networks,” in Proc. 4th ACM Workshop on Wireless Security (WiSe '05). New York, NY, USA: ACM, Nov. 2005, pp. 33–42.
T., Rappaport, Wireless Communications: Principles and Practice, 2nd edn. Upper Saddle River, NJ: Prentice Hall, 2002.
M., Raya, M. H., Manshaei, M., Felegyhazi, and J.-P., Hubaux, “Revocation games in ephemeral networks,” in Proc. 15th ACM Conf. on Computer Security (CCS), Alexandria, Virginia, USA, Oct. 2008, pp. 199–210.
M., Raya, R., Shokri, and J.-P., Hubaux, “On the tradeoff between trust and privacy in wireless ad hoc networks,” in Proc. 3rd ACM Conf. on Wireless Network Security (WiSec), March 2010.
P., Resnick and R., Zeckhauser, “Trust among strangers in Internet transactions: Empirical analysis of eBay's reputation system,” in The Economics of the Internet and E-Commerce, ser. Advances in Applied Microeconomics, M. R., Baye, ed. Amsterdam: Elsevier Science, 2002, vol. 11, pp. 127–157.
P., Resnick, R. J., Zeckhauser, J., Swanson, and K., Lockwood, “The value of reputation on eBay: A controlled experiment,” SSRN eLibrary, 2002.
J., Robinson, “The mathematical theory of optimal processes,” Ann Math., 54(2), 296–301, September 1951. [Online]. Available: http://www.jstor.org/stable/1969530
K., Rohloff and T., Başar, “The detection of RCS worm epidemics,” in Proc. ACM Workshop on Rapid Malcode, Fairfax, VA, 2005, pp. 81–86.
J. B., Rosen, “Existence and uniqueness of equilibrium points for concave n-person games,” Econometrica, 33(3), 520–534, July 1965.
S. M., Ross, Applied Probability with Optimization Applications. San Francisco: Holden-Day, Inc., 1970.
K., Rozinov, “Are usability and security two opposite directions in computer systems?” Nov. 2004. [Online]. Available: http://rozinov.sfs.poly.edu/papers/security_vs_usability.pdf
W., Saad, T., Alpcan, T., Başar, and A., Hjørungnes, “Coalitional game theory for security risk management,” in Proc. 5th Intl Conf. on Internet Monitoring and Protection (ICIMP), Barcelona, Spain, May 2010.
W., Saad, Z., Han, M., Debbah, A., Hjørungnes, and T., Başar, “Coalitional game theory for communication networks: A tutorial,” IEEE Signal Process. Mag., Special issue on Game Theory in Signal Processing and Communications, 26(5), 77–97, Sept. 2009.
F. A., Sadjadi, “Hypothesis testing in a distributed environment,” IEEE Trans. Aerosp. Electron. Syst., AES-22(2), 134–137, March 1986.
Y. E., Sagduyu, R., Berry, and A., Ephremides, “MAC games for distributed wireless network security with incomplete information of selfish and malicious user types,” in Proc. IEEE Intl Conf. on Game Theory for Networks (GameNets), 2009.
Y. E., Sagduyu and A., Ephremides, “A game-theoretic analysis of denial of service attacks in wireless random access,” J. Wireless Networks, 15, 651–666, July 2009.
K., Sallhammar, “Stochastic models for combined security and dependability evaluation,” PhD dissertation, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, Department of Telematics, 2007.
K., Sampigethaya, L., Huang, M., Li, R., Poovendran, K., Matsuura, and K., Sezaki, “CARAVAN: Providing location privacy for VANET,” in Proc. Embedded Security in Cars Conf. (ESCAR), 2005.
C. U., Saraydar, N., Mandayam, and D., Goodman, “Pricing and power control in a multicell wireless data network,” IEEE J. Sel. Areas Commun., pp. 1883–1892, Oct. 2001.
K., Scheinberg, “An efficient implementation of an active set method for SVMs,” J. Mach. Learning Res., 7, 2237–2257, Dec. 2006.
S., Schmidt, T., Alpcan, S., Albayrak, T., Başar, and A., Muller, “A malware detector placement game for intrusion detection,” in Proc. 2nd Intl Workshop on Critical Information Infrastructures Security (CRITIS), Malaga, Spain, Oct. 2007.
B., Schneier, “Schneier on security: A blog covering security and security technology,” 1999–2009. [Online]. Available: http://www.schneier.com/blog/
B., Schneier, Schneier on Security. Indianapolis, IN, USA: Wiley Publishing, 2008.
B., Scholkopf and A. J., Smola, Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. Cambridge, MA, USA: MIT Press, 2002.
J. S., Shamma and G., Arslan, “Unified convergence proofs of continuous-time fictitious play,” IEEE Trans. Autom. Control, 49(7), 1137–1141, July 2004.
J. S., Shamma, “Dynamic fictitious play, dynamic gradient play, and distributed convergence to nash equilibria,” IEEE Trans. Autom. Control, 50(3), 312–327, March 2005.
A., Simmonds, P., Sandilands, and L., van Ekert, “An ontology for network security attacks,” in Proc. 2nd Asian Applied Computing Conf. (AACC), ser. Lecture Notes in Computer Science. Kathmandu, Nepal: Springer, Oct. 2004, vol. 3285/2004, pp. 317–323.
S., Singh, The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography. New York: Anchor Books, 1999.
P., Sommer, “Design and analysis of realistic mobility model for wireless mesh networks,” Master's thesis, ETH Zürich, 2007.
M., Strasser, S., Capkun, C., Popper, and M., Cagalj, “Jamming-resistant key establishment using uncoordinated frequency hopping,” in Proc. IEEE Symp. on Security and Privacy (SP 2008), May 2008, pp. 64–78.
K., Suh, Y., Guo, J., Kurose, and D., Towsley, “Locating network monitors: Complexity, heuristics, and coverage,” in Proc. 24th IEEE Conf. on Computer Communications (Infocom), Miami, FL, March 2005, vol. 1, pp. 351–361.
N. N., Taleb, The Black Swan: The Impact of the Highly Improbable. New York, NY, USA: Random House Publishing, 2007.
A. S., Tanenbaum, Computer Networks, 2nd edn. Upper Saddle River, NJ, USA: Prentice-Hall, Inc., 1988.
R., Tenney and J. N. R., Sandell, “Detection with distributed sensors,” IEEE Trans. Aerosp. Electron. Syst., AES-17, 501–510, July 1981.
,The-Gambit-Project, “Gambit game theory analysis software and tools,” http://gambit.sourceforge.net/, 2002. [Online]. Available: http://gambit.sourceforge.net/
G., Theodorakopoulos and J. S., Baras, “Malicious users in unstructured networks,” in Proc. 22nd IEEE Conf. on Computer Communications (Infocom), May 2007, pp. 884–891.
J. N., Tsitsiklis, “Decentralized detection,” in Advances in Signal Processing, H. V., Poor and J. B., Thomas, eds. Grenuich CT: JAI Press, 1993, vol. 2, pp. 297–344.
J. N., Tsitsiklis, “Extremal properties of likelihood-ratio quantizers,” IEEE Trans. Commun., 41(4), 550–558, 1993.
J. N., Tsitsiklis and M., Athans, “On the complexity of decentralized decision making and detection problems,” IEEE Trans. Autom. Control, 30(5), 440–446, 1985. [Online]. Available: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1103988
J., Unnikrishnan and V. V., Veeravalli, “Decentralized detection with correlated observations,” in Proc. Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, USA, Nov. 2007.
J., von Neumann, “Zur Theorie der Gesellschaftsspiele,” Mathematische Annalen, 100(1), 295–320, Dec. 1928.
G., van Rossum, An Introduction to Python. Bristol: Network Theory Ltd, 2003.
H. L., van Trees, Detection, Estimation and Modulation Theory, New York, NY, USA: John Wiley & Sons, 1968, vol. I.
S., Vasudevan, J., Kurose, and D., Towsley, “On neighbor discovery in wireless networks with directional antennas,” in Proc. 24th IEEE Conf. on Computer Communications (Infocom), 2005.
D., Vaughan, The Challenger Launch Decision: Risky Technology, Culture, and Deviance at NASA. Chicago, IL, USA: University of Chicago Press.
V. V., Veeravalli, T., Başar, and H. V., Poor, “Decentralized sequential detection with a fusion center performing the sequential test,” IEEE Trans. on Inf. Theor., 39(2), 433–442, 1993.
V. V., Veeravalli, “Decentralized sequential detection with sensors performing sequential tests,” Math. Signals, Systs, and Control, 7(4), 292–306, 1994.
V. V., Veeravalli, “Minimax robust decentralized detection,” IEEE Trans. Inf. Theor., 40(1), 35–40, 1994.
M., Vogt and V., Kecman, “Active-set methods for support vector machines,” in Support Vector Machines: Theory and Applications, L., Wang, ed. Berlin, Heidelberg: Springer-Verlag, Aug. 2005, pp. 133–158.
N. N., Vorobev, Foundations of Game Theory: Noncooperative Games. Boston: Birkhäuser, 1994.
A., Wald, Sequential Analysis. New York, NY, USA: Dover Phoenix Editions, 2004.
P., Willett, P. F., Swaszek, and R. S., Blum, “The good, bad, and ugly: Distributed detection of a known signal in dependent gaussian noise,” IEEE Trans. Signal Process., 48, 3266–3279, Dec. 2000.
D., Zamboni, “Using internal sensors for computer intrusion detection,” PhD dissertation, Purdue University, August 2001.
J., Zander, “Jamming games in slotted ALOHA packet radio networks,” in IEEE Military Communications Conference (MILCOM), Morleley, CA, 1990, vol. 2, Sept. 30–Oct. 3, pp. 830–834.
D., Zhou, J., Weston, A., Gretton, O., Bousquet, and B., Schölkopf, “Ranking on data manifolds,” in Proc. NIPS, 2004, pp. 169–176.
F., Zhu and W., Zhu, “Rational exposure: A game theoretic approach to optimize identity exposure in pervasive computing environments,” in Proc. IEEE Intl Conf. on Pervasive Computing and Communications (PERCOM). Washington, DC, USA: IEEE Computer Society, 2009, pp. 1–8.
M., Zinkevich, A., Greenwald, and M. L., Littman, “Cyclic equilibria in markov games,” in Proc. Neural Information Processing Systems (NIPS), Vancouver, BC, Canada, December 2005.
C., Zou, W., Gong, and D., Towsley, “Worm propogation modeling and analysis under dynamic quarantine defense,” in Proc. ACM Workshop on Rapid Malcode, Washington, DC, 2003, pp. 51–60.
