  We study the two-sided stable matching problem with one-sided uncertainty for
two sets of agents A and B, with equal cardinality. Initially, the preference
lists of the agents in A are given but the preferences of the agents in B are
unknown. An algorithm can make queries to reveal information about the
preferences of the agents in B. We examine three query models: comparison
queries, interviews, and set queries. Using competitive analysis, our aim is to
design algorithms that minimize the number of queries required to solve the
problem of finding a stable matching or verifying that a given matching is
stable (or stable and optimal for the agents of one side). We present various
upper and lower bounds on the best possible competitive ratio as well as
results regarding the complexity of the offline problem of determining the
optimal query set given full information.
