From marriages to coalitions: A soft CSP approach

Research output: Chapter in Book/Report/Conference proceedingsChapterpeer-review

Abstract

In this work we represent the Optimal Stable Marriage problem as a Soft Constraint Satisfaction Problem. In addition, we extend this problem from couples of individuals to coalitions of generic agents, in order to define new coalition-formation principles and stability conditions. In the coalition case, we suppose the preference value as a trust score, since trust can describe the belief of a node in the capabilities of another node, in its honesty and reliability. Semiring-based soft constraints represent a general and expressive framework that is able to deal with distinct concepts of optimality by only changing the related c-semiring structure, instead of using different ad-hoc algorithms. At last, we propose an implementation of the classical OSM problem using integer linear programming tools.

Original languageEnglish
Title of host publicationRecent Advances in Constraints - 13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008, Revised Selected Papers
Pages1-15
Number of pages15
DOIs
Publication statusPublished - 2009
Event13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008 - Rome, Italy
Duration: 18 Jun 200820 Jun 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5655 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference13th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2008
Country/TerritoryItaly
CityRome
Period18/06/0820/06/08

Fingerprint

Dive into the research topics of 'From marriages to coalitions: A soft CSP approach'. Together they form a unique fingerprint.

Cite this