Authors: Sihem Ben Jouida; Hajer Ben Romdhane; Saoussen Krichen
Addresses: Higher Institute of Management of Tunis, University of Tunis, 41 Rue de la liberté, Le Bardo 2000, Tunisia ' Higher Institute of Management of Tunis, University of Tunis, 41 Rue de la liberté, Le Bardo 2000, Tunisia ' Faculty of Law, Economics and Management of Jendouba, University of Jendouba, Tunisia
Abstract: The group selection problem (GSP) models situations in which a decision maker (DM) is required to select the best from amongst a set of offers that are presented sequentially in a specified number of groups. Such a decision process is a part of everyday organisational life where dynamic decisions have to be taken in real time. However, practical scenarios involve more than one person in making critical decisions. Motivated by these facts, we address in this article the GSP with two DMs. We define the bilateral GSP as follows: two DMs are required to collectively make a choice from alternatives that are presented over time in groups. Every DM has its own evaluation of the inspected offers which may eventually lead to conflicts if the DMs do not agree on a decision. To solve this problem, we propose a dynamic programming approach incorporating conflict management rules to come up with a compromise decision. We test our approach on several data sets and for different DMs' utilities, and we finally show the relevance of our approach via convenient performance measures.
Keywords: dynamic programming; optimal stopping options; group decision making; game theory; bilateral group selection; conflict management.
International Journal of Operational Research, 2016 Vol.27 No.1/2, pp.184 - 200
Available online: 02 Aug 2016 *Full-text access for editors Access for subscribers Purchase this article Comment on this article