Andrey Garnaev

I am currently with WINLAB, Rutgers University, North Brunswick, NJ 08901, USA

My current research interests are:
Application of game theory to network protection and network’s economics.
Mathematical modeling of security and privacy, including information theoretic security.
Mathematical modeling of signal processing, data transmission and networking.  

Education:
1997: Doctor of Sciences in Computer Science and Applied Mathematics (Habilitation Degree). Faculty of Mathematics and Mechanics, Saint Petersburg State University, Saint Petersburg, Russia.  Thesis: Mathematical Modeling the Search Problems by Methods of Game Theory
1984-1987: Ph.D., Computer Science. Faculty of Applied Mathematics and Control Processes, Saint Petersburg State University, Saint Petersburg. Thesis: On a Class of Search Games
(In D.Sc. and Ph.D. different models of search with active adversary were investigated. Explicit solutions for such problems with optimal algorithms were derived, that could be useful in operations planning, networking, security, robotic systems with artificial intellect and so on)
1977-1982:   M.S., Mathematics, Summa Cum Laude (with Honour), GPA: 5.0/5.0. Faculty of Mathematics and Mechanics, Saint Petersburg State University, Saint Petersburg, Russia.  Thesis: Evaluation the Widths of the Euclidean Ball (Unimprovable upper estimation  was achieved. The result was published in 1984,  and is a part of so called  Kashin-Garnaev-Gluskin Inequality giving lower and upper estimates for the Gelfand widths of l_1 balls.   This inequality became a  useful tools in high-dimensional geometry, statistics, error correcting codes, and other fields, but may be the most impressive role it played in mathematical bases of a new scientific discipline - Compressed Sensing)
1977:   Tallinn City 19 High  School (currently  Tallinn Tõnismäe Reaalkool), Estonia
Published 17 books, 75+ papers in Refereed Journals, and  97+ papers in Refereed Conferences and Chapters in Books

Awards:
Best Paper Selection: Garnaev A.,  Trappe W., An Eavesdropping and Jamming Dilemma when the Adversary might be Subjective. IEEE Wireless Communications and Networking Conference (IEEE WCNC 2019),  Marrakech, Morocco, 15-18 April 2019.
Best Paper Award: Garnaev A.,  Trappe W., The rival  might be not smart:  revising  a CDMA jamming game.  IEEE Wireless Communications and Networking Conference (IEEE WCNC 2018), 15-18 April 2018, Barcelona, Spain. DOI:10.1109/WCNC.2018.8377296
Best Paper Award: Garnaev A., Sagari S. and Trappe W., Fair Allocation of Throughput under Harsh Operational Conditions, 8th International Workshop on Multiple Access Communications (MACOM 2015), September 3-4, 2015, Helsinki, Finland.
    Published in: Lecture Notes in Computer Science, Volume 9305,  pp 108-119, Springer, 2015 (Springer link)
Best Paper Award: Garnaev A., Trappe W., Secret communication when the eavesdropper might be an active adversary. 7th International Workshop on Multiple Access Communications (MACOM 2014), August 27-28, 2014, Halmstad, Sweden.
      Published in: Lecture Notes in Computer Science, Volume 8715,  pp 121-136, Springer, 2014 (Springer link)
Second Best Paper Award: Altman E., Avrachenkov K., Garnaev A., Jamming Game in Wireless Networks with Transmission Cost. The International Conference on Network Control and Optimization (NET-COOP 2007), Avignon, France, June 5-7, 2007,  Avignon, France.
    Published in: Lecture Notes in Computer Science, v.4465, pp.1-12, Springer, 2007. (Springer link) (PDF)
In 2007 I was awarded for outstanding teaching and scientific supervision of students at Saint Petersburg State University, Saint Petersburg, Russia
Books [2003], [2005] were bestsellers during several years.
Diploma of Full Professor in Computational Mathematics and Computer Science, The Ministry of a Science, University Education and Technical Policy, Moscow, 1999
Research Fellowship Award of The Royal Society, UK (1993-1994).
The Winner of Competition of All-Union Physical and Mathematical Journal “QUANTUM” for 1976 year, USSR