Title
On the invariance of the set of stable matchings with respect to substitutable preference profiles
Abstract
For the many-to-one matching model we give a procedure to partition the set of substitutable preference profiles into equivalence classes with the property that all profiles in the same class have the same set of stable matchings. This partition allows to reduce the amount of information required by centralized stable mechanisms.
Year
DOI
Venue
2008
10.1007/s00182-007-0080-7
Int. J. Game Theory
Keywords
Field
DocType
matching · stability · substitutable preferences · semilattice,matching,stable matching,stability,semilattice
Discrete mathematics,Combinatorics,Invariant (physics),Semilattice,Equivalence class,Partition (number theory),Mathematics
Journal
Volume
Issue
ISSN
36
3
1432-1270
Citations 
PageRank 
References 
2
0.70
4
Authors
4
Name
Order
Citations
PageRank
Ruth Martínez1223.09
Jordi Massó210316.46
Alejandro Neme38213.77
Jorge Oviedo4599.11