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

Corruption Networks: a Graph-game Approach

Student: Kachugin Artem

Supervisor: Mark I. Levin

Faculty: Faculty of Mathematics

Educational Programme: Mathematics (Bachelor)

Year of Graduation: 2017

Our work examines corruption from the perspective of its network nature. Although sometimes individual corrupt agents may be encountered, we believe that the structure of corrupt conspiracies is key for understanding problems of corruption emergence. In this study we combine methods of network and game theories and create an original model. Two specific models are presented. Bureaucrats are represented as the nodes of a graph, and their behaviour is defined by a rational choice in a specific game. The outcomes of the game vary depending on the graph structure. Our results are drawn from comparative analysis of different networks.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses