Projets par an
Résumé
Often matching problems and problems of coalition formation, are compu-
tationally hard to solve and exisiting algorithms are able to find allocations
that are stable but not Pareto-otpimal. We show in two specific applications,
hedonic games and school choice with constraints, that Genetic Alghritms
can be succesfully applied to find outcomes that Pareto-improve over allo-
cations obtained by existing algorithms.
tationally hard to solve and exisiting algorithms are able to find allocations
that are stable but not Pareto-otpimal. We show in two specific applications,
hedonic games and school choice with constraints, that Genetic Alghritms
can be succesfully applied to find outcomes that Pareto-improve over allo-
cations obtained by existing algorithms.
| langue originale | Anglais |
|---|---|
| Lieu de publication | Namur |
| Editeur | Namur center for complex systems |
| Nombre de pages | 25 |
| Volume | 4 |
| Edition | 8 |
| Etat de la publication | Publié - 19 août 2013 |
Série de publications
| Nom | naXys Technical Report Series |
|---|---|
| Editeur | University of Namur |
| Numéro | 8 |
| Volume | 4 |
mots-clés
- dynamical systems, cosmology, population dynamics
Empreinte digitale
Examiner les sujets de recherche de « PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS ». Ensemble, ils forment une empreinte digitale unique.-
Modèles socio-économiques de formation de consentement
Aldashev, G., Carletti, T. & RIGHI, S.
1/09/06 → …
Projet: Projet de thèse
-
PAI n°P7/19 - DYSCO: Dynamical systems, control and optimization (DYSCO)
Winkin, J., Blondel, V., Vandewalle, J., Pintelon, R., Sepulchre, R., Vande Wouwer, A. & Sartenaer, A.
1/04/12 → 30/09/17
Projet: Recherche