From Marriages to Coalitions: A Soft CSP Approach. Bistarelli, S., Foley, S. N., O'Sullivan, B., & Santini, F. 2009. doi abstract bibtex 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.
@conference{
11391_143835,
author = {Bistarelli, Stefano and Foley, SIMON N. and O'Sullivan, Barry and Santini, Francesco},
title = {From Marriages to Coalitions: A Soft CSP Approach},
year = {2009},
publisher = {Springer},
volume = {5655},
booktitle = {Revised Selected Papers Recent Advances in Constraints, CSCLP 2008},
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.},
doi = {10.1007/978-3-642-03251-6_1},
pages = {1--15}
}
Downloads: 0
{"_id":"CdXLq6fbpS3erXJK3","bibbaseid":"bistarelli-foley-osullivan-santini-frommarriagestocoalitionsasoftcspapproach-2009","author_short":["Bistarelli, S.","Foley, S. N.","O'Sullivan, B.","Santini, F."],"bibdata":{"bibtype":"conference","type":"conference","author":[{"propositions":[],"lastnames":["Bistarelli"],"firstnames":["Stefano"],"suffixes":[]},{"propositions":[],"lastnames":["Foley"],"firstnames":["SIMON","N."],"suffixes":[]},{"propositions":[],"lastnames":["O'Sullivan"],"firstnames":["Barry"],"suffixes":[]},{"propositions":[],"lastnames":["Santini"],"firstnames":["Francesco"],"suffixes":[]}],"title":"From Marriages to Coalitions: A Soft CSP Approach","year":"2009","publisher":"Springer","volume":"5655","booktitle":"Revised Selected Papers Recent Advances in Constraints, CSCLP 2008","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.","doi":"10.1007/978-3-642-03251-6_1","pages":"1–15","bibtex":"@conference{\n\t11391_143835,\n\tauthor = {Bistarelli, Stefano and Foley, SIMON N. and O'Sullivan, Barry and Santini, Francesco},\n\ttitle = {From Marriages to Coalitions: A Soft CSP Approach},\n\tyear = {2009},\n\tpublisher = {Springer},\n\tvolume = {5655},\n\tbooktitle = {Revised Selected Papers Recent Advances in Constraints, CSCLP 2008},\n\tabstract = {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.},\n\tdoi = {10.1007/978-3-642-03251-6_1},\t\n\tpages = {1--15}\n}\n","author_short":["Bistarelli, S.","Foley, S. N.","O'Sullivan, B.","Santini, F."],"key":"11391_143835","id":"11391_143835","bibbaseid":"bistarelli-foley-osullivan-santini-frommarriagestocoalitionsasoftcspapproach-2009","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"conference","biburl":"http://www.dmi.unipg.it/~bista/papers/pubblicazioni.bib","dataSources":["GhB5rb8JzW6az3exo"],"keywords":[],"search_terms":["marriages","coalitions","soft","csp","approach","bistarelli","foley","o'sullivan","santini"],"title":"From Marriages to Coalitions: A Soft CSP Approach","year":2009}