Testing Substitutability of Weak Preferences

Details Testing Substitutability of Weak Preferences Testing Substitutability of Weak Preferences

2012-01-02

arxiv.org/abs/1201.0432v1

Computer Science

Computer Science and Game Theory

7 pages

Scientific paper

In many-to-many matching models, substitutable preferences constitute the largest domain for which a pairwise stable matching is guaranteed to exist. In this note, we extend the recently proposed algorithm of Hatfield et al. [3] to test substitutability of weak preferences. Interestingly, the algorithm is faster than the algorithm of Hatfield et al. by a linear factor on the domain of strict preferences.

Affiliated with

Also associated with

No associations

Rating

Testing Substitutability of Weak Preferences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Testing Substitutability of Weak Preferences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Testing Substitutability of Weak Preferences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55327