175 search results - page 2 / 35 » Generalizing stable semantics by preferences |
ATAL
2005
Springer
13 years 10 months ago
2005
Springer
This paper focuses on the problem of generating coalition structures for task allocation via coalition formation. It provides a unified formal framework for constructing those co...
ACID
2006
13 years 6 months ago
2006
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practic...
JCO
2008
13 years 4 months ago
2008
We study variants of classical stable matching problems in which there is an additional requirement for a stable matching, namely that there should not be two participants who wou...
ACL
2009
13 years 2 months ago
2009
This paper explores methods to alleviate the effect of lexical sparseness in the classification of verbal arguments. We show how automatically generated selectional preferences ar...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem ha...