Power Indices Computable in Polynomial Time

Student: Elsakova Anna

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2017

Power indices and their computational properties are studied in this work. Axiomatic approach is used to find computational properties for arbitrary power indices and computational approach is used to calculate results. It is shown that if power index satisfies specific properties then then distinguish a power of a player by this index is NP-complete problem. Moreover, an original algorithm that allows to compute power indices with predetermined error in time polynomial in number of players and error is described. The results of this work may be used to study other computational properties of power indices.

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