Text

Technical Note—A Stochastic Assignment Problem with Unknown Eligibility Probabilities

Consider n initially empty boxes, numbered 1 through n. Balls arrive sequentially. Each ball has a binary n-vector attached to it, with the interpretation that the ball is eligible to be put in box i if component i of its vector is equal to 1. An arriving ball can be put in any empty box for which it is eligible. Assuming that components of the vector are independent Bernoulli random variables with initially unknown probabilities, our primary interest is to compare several policies to determine which leads to a stochastically smaller number of observed balls until all boxes are filled.

Ketersediaan

Informasi Detail

Judul Seri

OPERATIONS RESEARCH; Vol.69 No.1 January-February 2021

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 266 - 272

Bahasa

English

ISBN/ISSN

-

Klasifikasi

-

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

PROBABILITY
SEQUENTIAL ASSIGNMENT PROBLEM
STOCHASTIC MODEL APPLICATION

Info Detail Spesifik

https://doi.org/10.1287/opre.2020.1988

Pernyataan Tanggungjawab

Sheldon M. Ross, Gideon Weiss, Zhengyu Zhang

Versi lain/terkait

Lampiran Berkas

Komentar