Individual versus Social Optimization in the Allocation of Customers to Alternative Servers

DOI10.1287/MNSC.29.7.831zbMATH Open0514.90029OpenAlexW2120248764MaRDI QIDQ3661277FDOQ3661277

Colin E. Bell, Shaler jun. Stidham

Publication date: 1983

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.29.7.831

zbMATH Keywords

social optimumPoisson arrivalexponential serviceindividual optimumjoining behavioralternative serversdifferent service time distributionsK serverspre-emptive LIFO service

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (31)

• The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria
• The price of anarchy in loss systems
• Equitable transit charges for multi-administration telecommunications networks
• Optimal service‐capacity allocation in a loss system
• Monotonicity properties of user equilibrium policies for parallel batch systems
• User-Optimal State-Dependent Routeing in Parallel Tandem Queues with Loss
• Choosing a batch to be processed
• Inefficiency in stochastic queueing systems with strategic customers
• CHARACTERISTICS OF DETERMINISTIC OPTIMAL ROUTING FOR TWO HETEROGENEOUS PARALLEL SERVERS
• A duality approach to admission and scheduling controls of queues
• Non-cooperative queueing games on a network of single server queues
• Analysis of job assignment with batch arrivals among heterogeneous servers
• THE ALLOCATION OF CUSTOMERS IN A DISCRETE-TIME MULTI-SERVER QUEUEING SYSTEM
• The price of anarchy in an exponential multi-server
• Customers' joining behavior in an unobservable \(GI/Geo/m\) queue
• An optimal policy for joining a queue in processing two kinds of jobs
• A conservative index heuristic for routing problems with multiple heterogeneous service facilities
• Equilibrium behavior in tandem Markovian queues with heterogeneous delay-sensitive customers
• Probabilistic selfish routing in parallel batch and single-server queues
• Capacity competition of make-to-order firms
• Allocation of jobs and identical resources with two pooling centers
• Allocation of flows in closed bipartite queueing networks
• Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies
• User equilibria for a parallel queueing system with state dependent routing
• Asymptotically optimal open-loop load balancing
• Consolidating or non-consolidating queues: a game theoretic queueing model with holding costs
• Manufacturing lead times, system utilization rates and lead-time-related demand
• Strategic customer behavior in a two-stage batch processing system
• Optimal pricing for service facilities with self-optimizing customers
• Selfish routing in public services
• PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES

This page was built for publication: Individual versus Social Optimization in the Allocation of Customers to Alternative Servers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3661277)