Individual equilibrium and learning in processor sharing systems

DOI10.1287/OPRE.46.6.776MaRDI QIDQ2781155zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Dynamic service sharing with heterogeneous preferences
• Stochastic approximation and user adaptation in a competitive resource sharing system
• A strategic timing of arrivals to a linear slowdown processor sharing system
• Stable strategies for processor sharing systems
• On the Nash equilibria for the FCFS queueing system with load-increasing service rate

Cited in

(28)

• Equilibrium arrivals to preemptive queueing system with fixed reward for completing request
• Optimal arrivals to preemptive queueing system
• Optimal routeing in two-queue polling systems
• Strategic routing in heterogeneous discriminatory processor sharing queues
• A game theoretic framework for distributed computing with dynamic set of agents
• Mean-field game approach to admission control of an \(M/M/\infty \) queue with shared service cost
• scientific article; zbMATH DE number 5932241 (Why is no real title available?)
• Monotonicity properties of user equilibrium policies for parallel batch systems
• Stochastic approximation and user adaptation in a competitive resource sharing system
• Asynchronous stochastic approximation and adaptation in a competitive system
• Self-organized criticality in a dynamic game
• On the Nash equilibria for the FCFS queueing system with load-increasing service rate
• Multi-agent learning for engineers
• The efficiency-fairness balance of round robin scheduling
• Dynamic service sharing with heterogeneous preferences
• User equilibria for a parallel queueing system with state dependent routing
• Strategic experimentation in queues
• Social and monopoly optimization in observable queues
• Strategic joining in \(M/M/1\) retrial queues
• Rational joining behavior in a queueing system with abandonments
• scientific article; zbMATH DE number 7042402 (Why is no real title available?)
• Equilibrium Arrivals to Preemptive Queueing System with Fixed and Random Population Size
• Cooperative dynamics and Wardrop equilibria
• Optimal arrivals in a two-server rational random-access system with loss
• Equilibrium prices and flows in the passenger traffic problem
• Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities
• Strategic customer behavior in an \(M/M/1\) feedback queue
• Strategic customer behavior and optimal policies in a passenger-taxi double-ended queueing system with multiple access points and nonzero matching times

This page was built for publication: Individual equilibrium and learning in processor sharing systems

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