Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Estimation of service value parameters for a queue with unobserved balking

View through CrossRef
Abstract In Naor’s model (Econometrica 37:15–24, 1969), customers decide whether or not to join a queue after observing its length. This work considers a variation in which customers are heterogeneous in their service value (reward) R from completed service and homogeneous in the cost of staying in the system per unit of time. It is assumed that the values of customers are independent random variables generated from a common parametric distribution. The manager observes the queue length process, but not the balking customers. Assuming that the distribution of R admits a known parametric form, a Maximum Likelihood Estimator based on the queue length data is constructed for the underlying parameters of R . We provide verifiable conditions for which the estimator is consistent and asymptotically normal. The estimation procedure is further leveraged to construt a dynamic pricing scheme that estimates the revenue maximizing admission price by iteratively updating the price using the estimated parameters. The performance of the estimator and the pricing algorithm are studied through a series of simulation experiments.
Springer Science and Business Media LLC
Title: Estimation of service value parameters for a queue with unobserved balking
Description:
Abstract In Naor’s model (Econometrica 37:15–24, 1969), customers decide whether or not to join a queue after observing its length.
This work considers a variation in which customers are heterogeneous in their service value (reward) R from completed service and homogeneous in the cost of staying in the system per unit of time.
It is assumed that the values of customers are independent random variables generated from a common parametric distribution.
The manager observes the queue length process, but not the balking customers.
Assuming that the distribution of R admits a known parametric form, a Maximum Likelihood Estimator based on the queue length data is constructed for the underlying parameters of R .
We provide verifiable conditions for which the estimator is consistent and asymptotically normal.
The estimation procedure is further leveraged to construt a dynamic pricing scheme that estimates the revenue maximizing admission price by iteratively updating the price using the estimated parameters.
The performance of the estimator and the pricing algorithm are studied through a series of simulation experiments.

Related Results

Chaos-control and parallel queue synchronization of laser local area network
Chaos-control and parallel queue synchronization of laser local area network
In this work, we study the chaos-control and parallel queue synchronization of a laser local area network (LAN). We present and study specifically a “single-queue-double-parameter”...
Impact of Common Anticoagulants on Complete Blood Count Parameters Among Humans
Impact of Common Anticoagulants on Complete Blood Count Parameters Among Humans
Abstract Introduction Among the most frequently used anticoagulants in hematological testing are tetra-acetic acid (EDTA), sodium citrate, and sodium heparin. However, there is a n...
The phenomenon often happens and it has faced by the patient in the hospital were queue system and waiting time. A queue caused by a group of people had needed health service at th...
Large-time asymptotics of anomalous fluctuations in heavy-tailed renewal-reward processes
Large-time asymptotics of anomalous fluctuations in heavy-tailed renewal-reward processes
Asymptotiques à temps long de fluctuations anormales pour des processus de renouvellement-récompense à queue lourde Dans cette thèse, nous étudions principalement l...
Neural Causal Information Extractor for Unobserved Causes
Neural Causal Information Extractor for Unobserved Causes
Causal inference aims to faithfully depict the causal relationships between given variables. However, in many practical systems, variables are often partially observed, and some un...
Simulation of a queueing problem with balking
Simulation of a queueing problem with balking
Queueing systems become complicated if balking occurs, that is, if impatient customers refuse to join the queue. Analytical results for expected queue length and waiting time have ...
Simulation of a queueing problem with balking
Simulation of a queueing problem with balking
Queueing theory becomes considerably more complicated if impatient customers fail to join the queue, so-called balking. Analytical results have been obtained for the standard queue...

Back to Top