Optimal stopping problems by two or more decision makers: a survey
type: Item
instance of: scholarly article
title: Optimal stopping problems by two or more decision makers: a survey
zbMATH Open document ID: 1134.91337
author: Fouad Ben Abdelaziz
author: Saoussen Krichen
published in: Computational Management Science
publication date: 2008-05-20T00:00:00Z
Mathematics Subject Classification ID: 91A25
Mathematics Subject Classification ID: 60G40
Mathematics Subject Classification ID: 91A55
zbMATH DE Number: 5277427
zbMATH Keywords: dynamic programming
zbMATH Keywords: game theory
zbMATH Keywords: group decisions
zbMATH Keywords: optimal stopping
MaRDI profile type: Publication
full work available at URL: s10287-006-0029-5
OpenAlex ID: W1992314642
cites work: An interactive method for the optimal selection problem with two decision makers
cites work: A secretary problem with two decision makers
cites work: Dynamic programming formulation of the group interview problem with a general utility function
cites work: Selecting the best choice in the weighted secretary problem
cites work: Q5653410
cites work: THE HORSE GAME
cites work: ON A multi-person time-sequential game with priorities
cites work: A competitive best-choice problem with Poisson arrivals
cites work: Who solved the secretary problem? With comments and a rejoinder by the author
cites work: Bivariate Negotiations as a Problem of Stochastic Terminal Control
cites work: The Secretary Problem and Its Extensions: A Review
cites work: MULTI-VARIATE STOPPING PROBLEM WITH A MAJORITY RULE
cites work: Dynamic Programming and Decision Theory
cites work: Q3734198
cites work: Q3763926
cites work: Q3760325
cites work: Equilibrium Points in a Game Related to the Best Choice Problem
cites work: Sequential games with random priority
cites work: Q4017386
cites work: Q4168775
cites work: A SEQUENTIAL ALLOCATION GAME FOR TARGETS WITH VARYING VALUES
cites work: WHEN TO STOP : RANDOMLY APPEARING BIVARIATE TARGET VALUES
cites work: A BILATERAL SEQUENTIAL GAME FOR SUMS OF BIVARIATE RANDOM VARIABLES
cites work: Q3206156
cites work: NON-ZERO-SUM GAMES RELATED TO THE SECRETARY PROBLEM
cites work: Q3342240
cites work: Q3328314
cites work: Q3695044
cites work: Q3710348
cites work: Q3778572
cites work: Q3828913
cites work: Q3833899
cites work: Q3830835
cites work: Q3360026
cites work: Q3980013
cites work: Q4020524
cites work: Q4844877
cites work: Q4856908
cites work: Q4506083
cites work: Q4436408
cites work: A non-zero-sum no-information best-choice game
cites work: A Decision Model for the Multiple Criteria Group Secretary Problem: Theoretical Considerations
cites work: On multiple stopping bales
cites work: Q3815146
cites work: The Secretary Problem with an Unknown Number of Options
cites work: Optimizing a single uncertain selection by recall of observations
cites work: Double stopping by two decision-makers
cites work: Q4363263
cites work: An interactive dynamic programming approach to multicriteria discrete programming
cites work: Multicriteria dynamic programming with an application to the integer case
cites work: MULTI-VARIATE STOPPING PROBLEMS WITH A MONOTONE RULE
cites work: On a randomized strategy in Neveu's stopping problem
DOI: 10.1007/S10287-006-0029-5
description: scientific article; zbMATH DE number 5277427