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

Genetic algorithms
Positive ions

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: Namur center for complex systems.
Marelli, Virginie ; Niccolo', Antonio ; Carletti, Timoteo. / PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS. 8 ed. Namur : Namur center for complex systems, 2013. 25 p. (naXys Technical Report Series; 8).
@book{28024fbd5b8842fdae9b64b4a426a216,
title = "PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS",
abstract = "Often matching problems and problems of coalition formation, are compu-tationally hard to solve and exisiting algorithms are able to find allocationsthat are stable but not Pareto-otpimal. We show in two specific applications,hedonic games and school choice with constraints, that Genetic Alghritmscan be succesfully applied to find outcomes that Pareto-improve over allo-cations obtained by existing algorithms.",
keywords = "dynamical systems, cosmology, population dynamics",
author = "Virginie Marelli and Antonio Niccolo' and Timoteo Carletti",
year = "2013",
month = "8",
day = "19",
language = "English",
volume = "4",
series = "naXys Technical Report Series",
publisher = "Namur center for complex systems",
number = "8",
edition = "8",

}

Marelli, V, Niccolo', A & Carletti, T 2013, PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS. naXys Technical Report Series, no. 8, vol. 4, vol. 4, 8 edn, Namur center for complex systems, Namur.

PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS. / Marelli, Virginie; Niccolo', Antonio; Carletti, Timoteo.

8 ed. Namur : Namur center for complex systems, 2013. 25 p. (naXys Technical Report Series; Vol. 4, No. 8).

Research output: Book/Report/JournalOther report

TY - BOOK

T1 - PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS

AU - Marelli, Virginie

AU - Niccolo', Antonio

AU - Carletti, Timoteo

PY - 2013/8/19

Y1 - 2013/8/19

N2 - Often matching problems and problems of coalition formation, are compu-tationally hard to solve and exisiting algorithms are able to find allocationsthat are stable but not Pareto-otpimal. We show in two specific applications,hedonic games and school choice with constraints, that Genetic Alghritmscan be succesfully applied to find outcomes that Pareto-improve over allo-cations obtained by existing algorithms.

AB - Often matching problems and problems of coalition formation, are compu-tationally hard to solve and exisiting algorithms are able to find allocationsthat are stable but not Pareto-otpimal. We show in two specific applications,hedonic games and school choice with constraints, that Genetic Alghritmscan be succesfully applied to find outcomes that Pareto-improve over allo-cations obtained by existing algorithms.

KW - dynamical systems, cosmology, population dynamics

M3 - Other report

VL - 4

T3 - naXys Technical Report Series

BT - PARETO-IMPROVEMENT IN MATCHING PROBLEMS TROUGH GENETIC ALGORITHMS

PB - Namur center for complex systems

CY - Namur

ER -

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