Dean — Ivan Arzhantsev
First Deputy Dean— Tamara Voznesenskaya
Deputy Dean for Research and International Relations - Sergei Obiedkov
Deputy Dean for finance and administration - Irina Gergart
Phone: +7 (495) 772-95-90 * 12332
Moscow, 3 Kochnovsky Proezd (near metro station 'Aeroport').
The faculty trains developers and researchers. The programme has been created based on the experience of leading American and European universities, such as Stanford University (U.S.) and EPFL (Switzerland). Also taken into consideration when creating the faculty was the School of Data Analysis, which is one of the strongest postgraduate schools in the field of computer science in Russia. The wide range of elective courses will allow each student to create his or her own educational path. In the faculty, learning is based on practice and projects.
Decrouez G. G., Robinson A.
Risk Analysis: An International Journal. 2017.
Nesterov Y., Grapiglia G.
2017 SIAM Journal on Optimization. 2017.
Lomazova I. A.
In bk.: Application and Theory of Petri Nets and Concurrency. 38th International Conference, PETRI NETS 2017, Zaragoza, Spain, June 25–30, 2017, Proceedings. Vol. 10258: Lecture Notes in Computer Science. Switzerland: Springer International Publishing AG, 2017. P. 19-34.
Theory of Computing Systems. 2017. P. 1-15.
Protasov V. Y.
Mathematics of Computation. 2017. No. 86. P. 1499-1524.
On September 18-19, 2017 Vladimir Gurvich will give a mini-course "Topics in Game Theory".Address: Faculty of computer science, Kochnovsky proezd, 3.Language: English Schedule:
18.09.2017 12:10-15:00 (room 509)19.09.2017 16:40-19:00 (room 300)For the pass to the building email to firstname.lastname@example.org
In this mini-course we outline some classes of games solvable in pure strategies. The n-person games in both normal and positional forms are considered. Yet, we restrict ourselves by only the simplest classical concepts of solution: mostly by the Nash equilibrium; also the domination equilibrium and the core will be considered if time permits. We recall some general, old and new, criteria of solvability in pure strategies based on the notions of the effectiviity function and game form.
There are no prerequisites required.