Abstract

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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call