A new Secretary Problem is considered, where for fixed k and m one wins if at some time i = m(j .. 1) + 1 up to jm one selects one of the j best items among the first jm items, j = 1,...,k. Selection is based on relative ranks only. Interest lies in small k values, such as k = 2 or 3. This is...

Increasingly, conjoint analysts are being asked to design and analyze studies involving large numbers of attributes and/or attribute levels. Various types of approaches, including attribute bridging, Adaptive Conjoint Analysis, and hybrid models have been proposed to deal with the problem. This...