Veuillez utiliser cette adresse pour citer ce document :
https://hdl.handle.net/20.500.12177/4663
Titre: | Une représentation simplifiée des jeux simples complets |
Auteur(s): | Kenfack Lambou, Gervais |
Directeur(s): | Tchantcho, Bertrand |
Mots-clés: | Simple games Completeness Weighted votin Desirability relation Lattice |
Date de publication: | 2016 |
Editeur: | Université de Yaoundé 1 |
Résumé: | This work is a report of the work of F. Carreras and J. Freixas which deals with theclass of complete simple games and centers on their structure. Using an extension of Is-bell’s desirability relation to coalitions, different from the normally used, F. Carreras and J. Freixas associate with any complete simple game a lattice of coalition models basedupon the types of indifferent players. F. Carreras and J. Freixas establish the basic properties of a vector with natural components and a matrix with non negative integer entries,both closely related to the lattice, which are also shown to be characteristic invariants ofthe game, in the sense that they determine it uniquely up to isomorphisms. |
Pagination / Nombre de pages: | 63 Pages |
URI/URL: | https://hdl.handle.net/20.500.12177/4663 |
Collection(s) : | Mémoires soutenus |
Fichier(s) constituant ce document :
Fichier | Description | Taille | Format | |
---|---|---|---|---|
ENS_2016_mem_0424.pdf | 764.78 kB | Adobe PDF | Voir/Ouvrir |
Tous les documents du DICAMES sont protégés par copyright, avec tous droits réservés.