University of Twente Student Theses
Weight distribution in matching games
Hof, F. (2016) Weight distribution in matching games.
|
PDF
913kB |
| Abstract: | Simple games that permit a weight representation such that each winning coalition has a weight of at least 1 and all losing coalitions have a weight of at most α, are called α-roughly weighted games. For a given game the smallest such value of α is called the critical threshold of the game. Freixas and Kurz [1] improved the lower bound on α after initial work of Gvozdeva, Hemaspaandra and Slinko [2] and conjectured that their bound is tight. In this study we give a proof of their conjecture for simple games that have minimal winning coalitions of order 2. |
| Item Type: | Essay (Master) |
| Faculty: | BMS: Behavioural, Management and Social Sciences |
| Subject: | 31 mathematics |
| Programme: | Science Education and Communication MSc (60708) |
| Link to this item: | https://purl.utwente.nl/essays/69350 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page