On a class of best-choice problems

Boris A. Berezovskiy; Yuliy M. Baryshnikov; Alexander V. Gnedin

doi:10.1016/0020-0255(86)90056-3

On a class of best-choice problems

Boris A. Berezovskiy, Yuliy M. Baryshnikov, Alexander V. Gnedin

Research output: Contribution to journal › Article › peer-review

3 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	111-127
Number of pages	17
Journal	Information sciences
Volume	39
Issue number	1
DOIs	https://doi.org/10.1016/0020-0255(86)90056-3
Publication status	Published - Aug 1986
Externally published	Yes

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Theoretical Computer Science
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Access to Document

10.1016/0020-0255(86)90056-3

Cite this

@article{b320811f5982480ca4785fc4eb3d2608,

title = "On a class of best-choice problems",

abstract = "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.",

author = "Berezovskiy, {Boris A.} and Baryshnikov, {Yuliy M.} and Gnedin, {Alexander V.}",

year = "1986",

month = aug,

doi = "10.1016/0020-0255(86)90056-3",

language = "English",

volume = "39",

pages = "111--127",

journal = "Information sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

number = "1",

}

TY - JOUR

T1 - On a class of best-choice problems

AU - Berezovskiy, Boris A.

AU - Baryshnikov, Yuliy M.

AU - Gnedin, Alexander V.

PY - 1986/8

Y1 - 1986/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0022766219&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022766219&partnerID=8YFLogxK

U2 - 10.1016/0020-0255(86)90056-3

DO - 10.1016/0020-0255(86)90056-3

M3 - Article

AN - SCOPUS:0022766219

SN - 0020-0255

VL - 39

SP - 111

EP - 127

JO - Information sciences

JF - Information sciences

IS - 1

ER -

On a class of best-choice problems

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this