PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS

Virginie Marelli, Antonio Niccolo', Timoteo Carletti

Research output: Book/Report/JournalOther report

84 Downloads (Pure)

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.
Original languageEnglish
Place of PublicationNamur
PublisherNamur center for complex systems
Number of pages25
Volume4
Edition8
Publication statusPublished - 19 Aug 2013

Publication series

NamenaXys Technical Report Series
PublisherUniversity of Namur
No.8
Volume4

    Fingerprint

Cite this

Marelli, V., Niccolo', A., & Carletti, T. (2013). PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS. (8 ed.) (naXys Technical Report Series; Vol. 4, No. 8). Namur center for complex systems.