Optimum Bribing for Queue Position

@article{Kleinrock1967OptimumBF,
  title={Optimum Bribing for Queue Position},
  author={Leonard Kleinrock},
  journal={Oper. Res.},
  year={1967},
  volume={15},
  pages={304-318}
}
In this paper we consider that relative position in queue is determined according to the size of a customer's bribe which is paid before the customer sees the queue length. Such a policy allows the customer himself to affect his own queue position, rather than the classical approach of assuming that a customer is preassigned to some possibly continuous priority class. For the case of Poisson arrivals, arbitrary service time distribution, and arbitrary distribution of customer bribe, we obtain… 

Figures from this paper

Pricing strategies and service dieren tiation in queues | A prot maximization perspective
We consider the problem of pricing and scheduling the customers arriving at a service facility, with the objective of maximizing the prots of the facility, when the value of service and
Strategic arrivals to queues offering priority service
TLDR
This work considers strategic arrivals to a FCFS service system that starts service at a fixed time and has to serve a fixed number of customers, for example, an airplane boarding system and describes the unique Nash equilibria for this system.
Priority Auctions and Queue Disciplines That Depend on Processing Time
TLDR
This work analyzes the allocation of priority in queues via simple bidding mechanisms and shows how the convexity/concavity of the function expressing the costs of delay determines the queue discipline (i.e., shortest- processing-time-first (SPT), longest-processing- time- first (LPT) arising in a bidding equilibrium.
Self-Selecting Priority Queues with Burr Distributed Waiting Costs
Service providers, in the presence of congestion and heterogeneity of customer waiting costs, often introduce a fee-based premier option using which the customers self-segment themselves. Examples of
TR-2005-4 Pricing strategies and service differentiation in queues — A profit maximization perspective ∗
TLDR
This work considers the problem of pricing and scheduling the customers arriving at a service facility, with the objective of maximizing the profits of the facility, when the value of service and time-sensitivity of a customer are his private information, and characterize the structure of the optimal pricing-scheduling policy.
Computing Center Optimization by a Pricing-Priority Policy
TLDR
A genera model for the optimal allocation of priorities through pricing is considered and it has been found that if you have an estimate of the mean of the probability density function of the cost of delay per unit time ƒ(c), the cost differential is insensitive to the exact distribution.
Allocation of Waiting Time by Trading in Position on a G/M/S Queue
TLDR
It is shown that the resulting market in queue positions optimally allocates waiting time, including balking and reneging rules.
A System with a Choice of Highest-Bidder-First and FIFO Services
TLDR
The Wardrop equilibrium in such a system is characterized and the revenue to the server is analyzed and it is seen that when the total capacity is fixed and is shared between the FIFO and HBF servers, revenue is maximised when the FifO capacity is non zero.
Optimal Leadtime Differentiation via Diffusion Approximations
This study illustrates how a manufacturer can use leadtime differentiation-selling the same product to different customers at different prices based on delivery leadtime-to simultaneously increase
...
...

References

SHOWING 1-10 OF 17 REFERENCES
Priority Assignment in Waiting Line Problems
TLDR
The average elapsed time between the arrival in the line of a unit of a given priority and its admission to the facility for servicing is useful in evaluating the procedure by which priority assignments are made.
Queuing with Preemptive Priorities or with Breakdown
Preemptive priority is defined and contrasted with head-of-the line priority Poisson arrivals at a single server are assumed throughout, and only steady-state solutions are found. The effect on
Queuing Systems in Which the Discipline is “Last-Come, First-Served”
In this paper we compare the waiting-time distributions under different queue disciplines of customers in a single-server queuing system with Poisson input and general (independent) service time. To
Machine Repair as a Priority Waiting-Line Problem
TLDR
Cobham's results for the single channel case are found to be easily applicable to this type of priority assignment of machine-repair problem in which shortest jobs, rather than first arrivals, receive highest priority.
A delay dependent queue discipline
TLDR
Results are derived for a delay dependent priority system in which a unit'spriority is increased, from zero, linearly with time in proportion to a rate assigned to the unit's priority group.
A conservation law for a wide class of queueing disciplines
A large class of queueing disciplines is defined for Poisson arrival statistics. For this class, a Conservation Law is proven which constrains the allowed variation in the average waiting times.
A Proof for the Queuing Formula: L = λW
In a queuing process, let 1/λ be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is
Délais D’attente des Appels Téléphoniques Traités au hasard
SommaireDans l’étude ci-après, l’auteur établit les équations dont dépendent les durées d’attente, des appels téléphoniques traités au hasard. La probabilité pour qu’un appel ait une durée d’attente
...
...