Serveur d'exploration sur la télématique

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

From Marriages to Coalitions: A Soft CSP Approach

Identifieur interne : 000820 ( Istex/Checkpoint ); précédent : 000819; suivant : 000821

From Marriages to Coalitions: A Soft CSP Approach

Auteurs : Stefano Bistarelli [Italie] ; Simon Foley [Irlande (pays)] ; Barry O Ullivan [Irlande (pays)] ; Francesco Santini [Italie]

Source :

RBID : ISTEX:D13FECC39F6E4F772691A2D4310B2B139417E38A

Abstract

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.

Url:
DOI: 10.1007/978-3-642-03251-6_1


Affiliations:


Links toward previous steps (curation, corpus...)


Links to Exploration step

ISTEX:D13FECC39F6E4F772691A2D4310B2B139417E38A

Le document en format XML

<record>
<TEI wicri:istexFullTextTei="biblStruct:series">
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">From Marriages to Coalitions: A Soft CSP Approach</title>
<author>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
</author>
<author>
<name sortKey="Foley, Simon" sort="Foley, Simon" uniqKey="Foley S" first="Simon" last="Foley">Simon Foley</name>
</author>
<author>
<name sortKey="O Ullivan, Barry" sort="O Ullivan, Barry" uniqKey="O Ullivan B" first="Barry" last="O Ullivan">Barry O Ullivan</name>
</author>
<author>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:D13FECC39F6E4F772691A2D4310B2B139417E38A</idno>
<date when="2009" year="2009">2009</date>
<idno type="doi">10.1007/978-3-642-03251-6_1</idno>
<idno type="url">https://api.istex.fr/document/D13FECC39F6E4F772691A2D4310B2B139417E38A/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002169</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002169</idno>
<idno type="wicri:Area/Istex/Curation">002169</idno>
<idno type="wicri:Area/Istex/Checkpoint">000820</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000820</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title level="a" type="main" xml:lang="en">From Marriages to Coalitions: A Soft CSP Approach</title>
<author>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Dipartimento di Scienze, Università “G. d’Annunzio” di Chieti-Pescara</wicri:regionArea>
<wicri:noRegion>Università “G. d’Annunzio” di Chieti-Pescara</wicri:noRegion>
</affiliation>
<affiliation wicri:level="3">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Istituto di Informatica e Telematica (CNR), Pisa</wicri:regionArea>
<placeName>
<settlement type="city">Pise</settlement>
<region nuts="2">Toscane</region>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Dipartimento di Matematica e Informatica, Università di Perugia</wicri:regionArea>
<wicri:noRegion>Università di Perugia</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
</author>
<author>
<name sortKey="Foley, Simon" sort="Foley, Simon" uniqKey="Foley S" first="Simon" last="Foley">Simon Foley</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Irlande (pays)</country>
<wicri:regionArea>Department of Computer Science, University College Cork</wicri:regionArea>
<wicri:noRegion>University College Cork</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Irlande (pays)</country>
</affiliation>
</author>
<author>
<name sortKey="O Ullivan, Barry" sort="O Ullivan, Barry" uniqKey="O Ullivan B" first="Barry" last="O Ullivan">Barry O Ullivan</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Irlande (pays)</country>
<wicri:regionArea>Department of Computer Science, University College Cork</wicri:regionArea>
<wicri:noRegion>University College Cork</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country xml:lang="fr">Irlande (pays)</country>
<wicri:regionArea>Cork Constraint Computation Centre, University College Cork</wicri:regionArea>
<wicri:noRegion>University College Cork</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Irlande (pays)</country>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Irlande (pays)</country>
</affiliation>
</author>
<author>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Dipartimento di Scienze, Università “G. d’Annunzio” di Chieti-Pescara</wicri:regionArea>
<wicri:noRegion>Università “G. d’Annunzio” di Chieti-Pescara</wicri:noRegion>
</affiliation>
<affiliation wicri:level="3">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>Istituto di Informatica e Telematica (CNR), Pisa</wicri:regionArea>
<placeName>
<settlement type="city">Pise</settlement>
<region nuts="2">Toscane</region>
</placeName>
</affiliation>
<affiliation wicri:level="1">
<country xml:lang="fr">Italie</country>
<wicri:regionArea>IMT - Scuola di Studi Avanzati, Lucca</wicri:regionArea>
<wicri:noRegion>Lucca</wicri:noRegion>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
<affiliation wicri:level="1">
<country wicri:rule="url">Italie</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series>
<title level="s">Lecture Notes in Computer Science</title>
<imprint>
<date>2009</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">D13FECC39F6E4F772691A2D4310B2B139417E38A</idno>
<idno type="DOI">10.1007/978-3-642-03251-6_1</idno>
<idno type="ChapterID">1</idno>
<idno type="ChapterID">Chap1</idno>
</biblStruct>
</sourceDesc>
<seriesStmt>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass></textClass>
<langUsage>
<language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">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.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Irlande (pays)</li>
<li>Italie</li>
</country>
<region>
<li>Toscane</li>
</region>
<settlement>
<li>Pise</li>
</settlement>
</list>
<tree>
<country name="Italie">
<noRegion>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
</noRegion>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Bistarelli, Stefano" sort="Bistarelli, Stefano" uniqKey="Bistarelli S" first="Stefano" last="Bistarelli">Stefano Bistarelli</name>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
<name sortKey="Santini, Francesco" sort="Santini, Francesco" uniqKey="Santini F" first="Francesco" last="Santini">Francesco Santini</name>
</country>
<country name="Irlande (pays)">
<noRegion>
<name sortKey="Foley, Simon" sort="Foley, Simon" uniqKey="Foley S" first="Simon" last="Foley">Simon Foley</name>
</noRegion>
<name sortKey="Foley, Simon" sort="Foley, Simon" uniqKey="Foley S" first="Simon" last="Foley">Simon Foley</name>
<name sortKey="O Ullivan, Barry" sort="O Ullivan, Barry" uniqKey="O Ullivan B" first="Barry" last="O Ullivan">Barry O Ullivan</name>
<name sortKey="O Ullivan, Barry" sort="O Ullivan, Barry" uniqKey="O Ullivan B" first="Barry" last="O Ullivan">Barry O Ullivan</name>
<name sortKey="O Ullivan, Barry" sort="O Ullivan, Barry" uniqKey="O Ullivan B" first="Barry" last="O Ullivan">Barry O Ullivan</name>
<name sortKey="O Ullivan, Barry" sort="O Ullivan, Barry" uniqKey="O Ullivan B" first="Barry" last="O Ullivan">Barry O Ullivan</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000820 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000820 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    TelematiV1
   |flux=    Istex
   |étape=   Checkpoint
   |type=    RBID
   |clé=     ISTEX:D13FECC39F6E4F772691A2D4310B2B139417E38A
   |texte=   From Marriages to Coalitions: A Soft CSP Approach
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Thu Nov 2 16:09:04 2017. Site generation: Sun Mar 10 16:42:28 2024