A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.
NI-ATH AlgorithmicTheories of Games Extent of teaching: 2P+2C Instructor: Knop D., Valla T. Completion: Z,ZK Department: 18101 Credits: 4 Semester: L Annotation:
Traditional game theory is a branch of mathematics, which has broad applications in economy, biology, politics and computer science. This theory studies the behaviour of agents (players) of a certain competitive process by designinng a mathematical model and investigating the strategies. The traditional task of classical game theory is to find the equilibria, which are the states of the game where no player wants to deviate from his strategy. Due to the recent development of computers, internet, social networks, online auctions, advertising, multiagent systems and other concepts the algorithmic point of view is gaining attention. In addition to existential questions we study the problems of efficient computation of various solution concepts. In this course we introduce the basics of game theory of many players, solution concept (usually equilibria) and methods of their computation.
Lecture syllabus:
1) introduction to game theory 1 2) introduction to game theory 2 3) computing Nash equilibria and the class PPAD 1 4) computing Nash equilibria and the class PPAD 2 5) computing Nash equilibria and the class PPAD 3 6) election theory, impossibility theorems 1 7) election theory, impossibility theorems 2 8) election theory, impossibility theorems 3 9) gerry mandering 10) combinatorial auctions 11) mechanism design 12) equlibria effectivity Seminar syllabus:
Tutorials for deeper understanding the theory presented in the course, analysing simpler games.Literature:
Nisan, Roughgarden, Tardos, Vazirani: Algorithmic Game Theory Dresher: The mathematics of games of strategy Cramton, Shoham, Steinberg: Combinatorial Auctions Brandt, Conitzer, Endriss, Lang, Procaccia: Handbook of Computational Social Choice Rothe: Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair DivisionRequirements:
Some knowledge of graph theory, combinatorics and algebra.
Informace o předmětu a výukové materiály naleznete na https://courses.fit.cvut.cz/MI-ATH/ The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester NI-PB.2020 Computer Security V Není NI-ZI.2020 Knowledge Engineering V Není NI-SPOL.2020 Unspecified Branch/Specialisation of Study V Není NI-TI.2020 Computer Science V Není NI-TI.2023 Computer Science V Není NI-NPVS.2020 Design and Programming of Embedded Systems V Není NI-PSS.2020 Computer Systems and Networks V Není NI-MI.2020 Managerial Informatics V Není NI-SI.2020 Software Engineering (in Czech) V Není NI-SP.2020 System Programming V Není NI-WI.2020 Web Engineering V Není NI-SP.2023 System Programming V Není
Page updated 25. 4. 2024, semester: Z,L/2023-4, Z/2019-20, Z/2024-5, L/2022-3, Z/2020-1, Z,L/2021-2, L/2020-1, Z/2022-3, L/2019-20, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška