On a class of best-choice problems
type: Item
instance of: scholarly article
title: On a class of best-choice problems
zbMATH Open document ID: 0611.90012
DOI: 10.1016/0020-0255(86)90056-3
author: B. A. Berezovskij
author: Yuliy M. Baryshnikov
author: Alexander Gnedin
published in: Information Sciences
publication date: 1986-01-01T00:00:00Z
review text: Consideration is given to a new generalized version of the familiar best- choice problem, related to the well-known collective-choice-theory conception of choice function. Certain classes of stopping rules are introduced, and the probability of selecting one of the best (with respect to a given choice function) alternatives is estimated. This work is an approach to choice theory from the viewpoint of statistical sequential analysis.
Mathematics Subject Classification ID: 91B14
Mathematics Subject Classification ID: 60G40
zbMATH DE Number: 3989042
zbMATH Keywords: best-choice problem
zbMATH Keywords: stopping rules
zbMATH Keywords: statistical sequential analysis
MaRDI profile type: Publication
full work available at URL: 0020-0255(86)90056-3
OpenAlex ID: W1997571681
cites work: On the Distribution of the Number of Admissible Points in a Vector Random Sample
cites work: Probability of stopping at a nondominated option
cites work: Q3669130
cites work: Q3702324
cites work: On an optimal stopping problem of Gusein-Zade
cites work: Multicriterial problem of optimum stopping of the selection process
cites work: Q5601976
cites work: Optimal Sequential Procedures when More Than one Stop is Required
cites work: Q3875087
cites work: Q5641856
cites work: Q5635232
cites work: Q3921912
description: scientific article; zbMATH DE number 3989042