Preference Elicitation and Interview Minimization in Stable Matchings

  • Drummond J
  • Boutilier C
N/ACitations
Citations of this article
16Readers
Mendeley users who have this article in their library.

Abstract

While stable matching problems are widely studied, little work has investigated schemes for effectively eliciting agent preferences using either preference (e.g., comparison) queries for interviews (to form such comparisons); and no work has addressed how to combine both. We develop a new model for representing and assessing agent preferences that accommodates both forms of information and (heuristically) minimizes the number of queries and interviews required to determine a stable matching. Our Refine-then-Interview (RtI) scheme uses coarse preference queries to refine knowledge of agent preferences and relies on interviews only to assess comparisons of relatively “close” options. Empirical results show that RtI compares favorably to a recent pure interview minimization algorithm, and that the number of interviews it requires is generally independent of the size of the market.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Drummond, J., & Boutilier, C. (2014). Preference Elicitation and Interview Minimization in Stable Matchings. Proceedings of the AAAI Conference on Artificial Intelligence, 28(1). https://doi.org/10.1609/aaai.v28i1.8829

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 10

63%

Researcher 4

25%

Professor / Associate Prof. 2

13%

Readers' Discipline

Tooltip

Computer Science 8

53%

Economics, Econometrics and Finance 3

20%

Social Sciences 2

13%

Engineering 2

13%

Save time finding and organizing research with Mendeley

Sign up for free