Related papers: Estimation of service value parameters for a queue…
We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at low or high rate, which can be adapted at exponential inspection times. When…
In online marketplaces, customers have access to hundreds of reviews for a single product. Buyers often use reviews from other customers that share their type -- such as height for clothing, skin type for skincare products, and location for…
We revisit the online dynamic acknowledgment problem. In the problem, a sequence of requests arrive over time to be acknowledged, and all outstanding requests can be satisfied simultaneously by one acknowledgement. The goal of the problem…
In this paper, we propose a stochastic model to describe how search service providers charge client companies based on users' queries for the keywords related to these companies' ads by using certain advertisement assignment strategies. We…
We present a broad literature survey of parameter and state estimation for queueing systems. Our approach is based on various inference activities, queueing models, observations schemes, and statistical methods. We categorize these into…
A stochastic queueing network model with parameter-dependent service times and routing mechanism, and its related performance measures are considered. An estimate of performance measure gradient is proposed, and rather general sufficient…
We describe a novel framework for discrete choice modeling and price optimization for settings where scheduled service options (often hierarchical) are offered to customers, which is applicable across many businesses including some within…
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by…
Most recent research in network revenue management incorporates choice behavior that models the customers' buying logic. These models are consequently more complex to solve, but they return a more robust policy that usually generates better…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…
Randomized mechanisms, which map a set of bids to a probability distribution over outcomes rather than a single outcome, are an important but ill-understood area of computational mechanism design. We investigate the role of randomized…
In this paper, we consider the number of both arrivals and departures seen by a tagged customer while in service in a classical $M/M/1$ processor sharing queue. By exploiting the underlying orthogonal structure of this queuing system…
We develop a nonparametric approach to identify and estimate consumer preferences and unobserved heterogeneity under nonlinear price schedules. Leveraging variation across multiple price schedules, we show that both the utility function and…
This paper provides a mathematical framework for estimation of the service time distribution and the expected service time of an infinite-server queueing system with a nonhomogeneous Poisson arrival process, in the case of partial…
Accurate travel products price forecasting is a highly desired feature that allows customers to take informed decisions about purchases, and companies to build and offer attractive tour packages. Thanks to machine learning (ML), it is now…
We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy…
Recently, there is growing interest and need for dynamic pricing algorithms, especially, in the field of online marketplaces by offering smart pricing options for big online stores. We present an approach to adjust prices based on the…
To choose between two discrete goods, a consumer pays attention to only those with prices below a threshold. From these, she chooses her most preferred good. We assume consumers in a population have the same preference but may have…
We consider the fundamental scenario where a single item is to be sold to one of two agents. Both agents draw their valuation for the item from the same probability distribution. However, only one of them submits a bid to the mechanism. The…
This paper examines a single-server queueing system that serves both scheduled and strategic walk-in customers. The service discipline follows a first-come, first-served policy, with scheduled customers granted non-preemptive priority. Each…