A DECISION-MODEL FOR THE MULTIPLE CRITERIA GROUP SECRETARY PROBLEM - THEORETICAL CONSIDERATIONS

A decision model is developed for solving the discrete multiple criter ia group secretary problem. The model extends the single decision-make r progressive algorithm by Korhonen, Moskowitz and Wallenius to group contexts. As the original progressive algorithm, it relaxes the usual assumption of a fixed set of available decision alternatives and compl ete knowledge of a decision-maker's preference structure (value functi on). The decision-makers are requested to settle on a compromise, if p ossible. The model then proceeds with determining the likelihood of fi nding possibly/surely better settlements (compromises). Linear value f unctions, linear prospect theory-type value functions, and quasiconcav e value functions are considered.