Article ID: | iaor19971488 |
Country: | United Kingdom |
Volume: | 47 |
Issue: | 8 |
Start Page Number: | 1046 |
End Page Number: | 1053 |
Publication Date: | Aug 1996 |
Journal: | Journal of the Operational Research Society |
Authors: | Wallenius Jyrki, Salminen Pekka, Teich Jeffrey E. |
Keywords: | programming: multiple criteria, measurement |
A decision model is developed for solving the discrete multiple criteria group secretary problem. The model extends the single decision-maker 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 complete knowledge of a decision-maker’s preference structure (value function). The decision-makers are requested to settle on a compromise, if possible. The model then proceeds with determining the likelihood of finding possibly/surely better settlements (compromises). Linear value functions, linear prospect theory-type value functions, and quasiconcave value functions are considered.