Results 11 to 20 of about 2,017,974 (284)
Stable marriage with incomplete lists and ties [PDF]
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and several relaxations have been proposed, including the following two common ...
Miyazaki, S. +3 more
core +11 more sources
The exchange-stable marriage problem [PDF]
In this paper we consider instances of stable matching problems, namely the classical stable marriage (SM) and stable roommates (SR) problems and their variants. In such instances we consider a stability criterion that has recently been proposed, that of
Cechlarova, K., Manlove, D.F.
core +3 more sources
Stable marriages and search frictions [PDF]
Stable matchings are the primary solution concept for two-sided matching markets with nontransferable utility. We investigate the strategic foundations of stability in a decentralized matching market.
Nöldeke, Georg, Lauermann, Stephan
core +6 more sources
A constraint programming approach to the stable marriage problem [PDF]
The Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a Constraint Satisfaction Problem.
Gent, Ian Philip +15 more
core +9 more sources
A Note on the Uniqueness of Stable Marriage Matching
In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd
Drgas-Burchardt Ewa
doaj +2 more sources
Bribery and Control in Stable Marriage [PDF]
We initiate the study of external manipulations in Stable Marriage by considering several manipulative actions as well as several manipulation goals. For instance, one goal is to make sure that a given pair of agents is matched in a stable solution, and this may be achieved by the manipulative action of reordering some agents' preference lists.
Niclas Boehmer +3 more
openaire +6 more sources
Seen as stable marriages [PDF]
In this paper, we advocate the use of stable matching framework in solving networking problems, which are traditionally solved using utility-based optimization or game theory. Born in economics, stable matching efficiently resolves conflicts of interest among selfish agents in the market, with a simple and elegant procedure of deferred acceptance.
Hong Xu 0001, Baochun Li
openaire +1 more source
Stable Marriage with General Preferences [PDF]
This is an extended version of a paper to appear at the The 7th International Symposium on Algorithmic Game Theory (SAGT 2014)
Linda Farczadi +2 more
openaire +3 more sources
A stable marriage requires communication [PDF]
The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $Θ(n^2)$ steps to find a stable marriage in the worst case, but only $Θ(n \log n)$ steps in the average case (with $n$ women and $n$ men). In 1976, Knuth asked whether the worst-case running time can be improved in a model of computation that does not require sequential access ...
Yannai A. Gonczarowski +3 more
openaire +8 more sources
Investigating the preference of women activists in family formation with emphasis on the concept of selectivity [PDF]
The importance of the family has long been important - even in the unbridled societies of the West and the East - but the family today seems to have changed. So that in modern families, the role of families in marriage is very minimal. In the traditional
Mohammad Hossein Shahabadi +1 more
doaj +1 more source

