Dynamic service sharing with heterogeneous preferences

DOI10.1023/A:1019133809177MaRDI QIDQ1587099zbMATH OpenFDO

Authors Israel Ben-Shahar, Ariel Orda, Nahum Shimkin

Publication date 22 November 2000

Published in Queueing Systems (Search for Journal in Brave)

zbMATH Keywords

Nash equilibriumdynamic gamesresource sharingprocessor sharing queuesbest-effort serviceindividual optimality

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Noncooperative games (91A10) Communication networks in operations research (90B18)

Recommendations

• Individual equilibrium and learning in processor sharing systems
• Stochastic approximation and user adaptation in a competitive resource sharing system
• Dynamic Admission Game into an M/M/1 Queue
• On the Nash equilibria for the FCFS queueing system with load-increasing service rate
• Stable strategies for processor sharing systems

Cited in

(8)

• Monotonicity properties of user equilibrium policies for parallel batch systems
• Stochastic approximation and user adaptation in a competitive resource sharing system
• On the Nash equilibria for the FCFS queueing system with load-increasing service rate
• scientific article; zbMATH DE number 530047 (Why is no real title available?)
• User equilibria for a parallel queueing system with state dependent routing
• A model for equilibrium in some service-provider user-set interactions
• Individual equilibrium and learning in processor sharing systems
• scientific article; zbMATH DE number 440560 (Why is no real title available?)

This page was built for publication: Dynamic service sharing with heterogeneous preferences

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