Individual Equilibrium and Learning in Processor Sharing Systems

DOI10.1287/opre.46.6.776zbMath0987.90020OpenAlexW2154964352MaRDI QIDQ2781155

Eitan Altman, Nahum Shimkin

Publication date: 18 March 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.46.6.776

zbMATH Keywords

Nash equilibriumnoncooperative dynamic gameprocessor-sharing service system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic games, stochastic differential games (91A15) Dynamic games (91A25) Rationality and learning in game theory (91A26)

Related Items

Optimal arrivals in a two-server rational random-access system with loss ⋮ Optimal routeing in two-queue polling systems ⋮ User equilibria for a parallel queueing system with state dependent routing ⋮ The efficiency-fairness balance of round robin scheduling ⋮ Equilibrium arrivals to preemptive queueing system with fixed reward for completing request ⋮ Monotonicity properties of user equilibrium policies for parallel batch systems ⋮ On the Nash equilibria for the FCFS queueing system with load-increasing service rate ⋮ Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost ⋮ Self-organized criticality in a dynamic game ⋮ Equilibrium Prices and Flows in the Passenger Traffic Problem ⋮ Cooperative dynamics and Wardrop equilibria ⋮ Strategic customer behavior in an \(M/M/1\) feedback queue ⋮ Social and Monopoly Optimization in Observable Queues ⋮ Strategic experimentation in queues ⋮ Rational joining behavior in a queueing system with abandonments ⋮ Multi-agent learning for engineers ⋮ Strategic customer behavior and optimal policies in a passenger-taxi double-ended queueing system with multiple access points and nonzero matching times ⋮ Optimal arrivals to preemptive queueing system ⋮ Strategic joining in \(M/M/1\) retrial queues