DMCA
Elicitation and approximately stable matching with partial preferences (2013)
Cached
Download Links
| Venue: | In Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI-13 |
| Citations: | 4 - 3 self |
BibTeX
@INPROCEEDINGS{Drummond13elicitationand,
author = {Joanna Drummond and Craig Boutilier},
title = {Elicitation and approximately stable matching with partial preferences},
booktitle = {In Proceedings of the Twenty-third International Joint Conference on Artificial Intelligence (IJCAI-13},
year = {2013}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Algorithms for stable marriage and related matching problems typically assume that full preference information is available. While the Gale-Shapley algorithm can be viewed as a means of eliciting preferences incrementally, it does not prescribe a general means for matching with incomplete information, nor is it designed to minimize elicitation. We propose the use of maximum regret to measure the (inverse) degree of stability of a matching with partial preferences; minimax regret to find matchings that are maximally stable in the presence of partial preferences; and heuristic elicitation schemes that use max regret to determine relevant preference queries. We show that several of our schemes find stable matchings while eliciting considerably less preference information than Gale-Shapley and are much more appropriate in settings where approximate stability is viable. 1
Keyphrases
partial preference approximate stability stable marriage related matching problem full preference information preference information incomplete information relevant preference query heuristic elicitation scheme maximum regret max regret general mean stable matchings gale-shapley algorithm
