Projects per year
Abstract
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.
| Original language | English |
|---|---|
| Place of Publication | Namur |
| Publisher | Namur center for complex systems |
| Number of pages | 25 |
| Volume | 4 |
| Edition | 8 |
| Publication status | Published - 19 Aug 2013 |
Publication series
| Name | naXys Technical Report Series |
|---|---|
| Publisher | University of Namur |
| No. | 8 |
| Volume | 4 |
Fingerprint
Dive into the research topics of 'PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS'. Together they form a unique fingerprint.-
Socio-economic models of opinion formation
Aldashev, G. (CoI), Carletti, T. (CoI) & RIGHI, S. (Researcher)
1/09/06 → …
Project: PHD
-
PAI n°P7/19 - DYSCO: Dynamical systems, control and optimization (DYSCO)
Winkin, J. (CoI), Blondel, V. (PI), Vandewalle, J. (CoI), Pintelon, R. M. (CoI), Sepulchre, R. (CoI), Vande Wouwer, A. (CoI) & Sartenaer, A. (CoI)
1/04/12 → 30/09/17
Project: Research