• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Contacts

Dean — Ivan Arzhantsev

 

First Deputy Dean— Tamara Voznesenskaya

 

Deputy Dean for Research and International Relations - Sergei Obiedkov

 

Deputy Dean for finance and administration - Irina Plisetskaya

 

Dean's office
 

Phone: +7 (495) 772-95-90 * 12332

computerscience@hse.ru

Moscow, 3 Kochnovsky Proezd (near metro station 'Aeroport'). 

Article
Colourings of Uniform Hypergraphs with Large Girth and Applications

Shabanov D. S., Kupavskii A.

Combinatorics Probability and Computing. 2017.

Book chapter
A Fast Scaling Algorithm for the Weighted Triangle-Free 2-Matching Problem

Artamonov S., Babenko M. A.

In bk.: Combinatorial Algorithms. 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers. Vol. 9538. Switzerland: Springer International Publishing, 2016. P. 25-37.

Book chapter
Any-Angle Pathfinding for Multiple Agents Based on SIPP Algorithm

Yakovlev K., Andreychuk A.

In bk.: Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017). Palo Alto: AAAI Press, 2017. P. 586-594.

Article
Cohomology of toric origami manifolds with acyclic proper faces

Ayzenberg A., Masuda M., Park S. et al.

Journal of Symplectic Geometry. 2017. Vol. 15. No. 3. P. 645-685.

Mini-course "Topics in Game Theory". Lecturer: Vladimir Gurvich

Event ended

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 evavilova@hse.ru


Abstract 

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.