Optimal incentive-compatible priority pricing for the M/M/1 queue
Operations Research
Externalities, Tangible Externalities, and Queue Disciplines
Management Science
Dynamic Pricing for Network Service: Equilibrium and Stability
Management Science
Congestion-dependent pricing of network services
IEEE/ACM Transactions on Networking (TON)
A survey on networking games in telecommunications
Computers and Operations Research
Generalized nash bargaining solution for bandwidth allocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
On static pricing of threshold-policies at a single queue
MOAS'07 Proceedings of the 18th conference on Proceedings of the 18th IASTED International Conference: modelling and simulation
A survey on networking games in telecommunications
Computers and Operations Research
On static pricing of threshold-policies at a single queue
MS '07 The 18th IASTED International Conference on Modelling and Simulation
Queueing game models for differentiated services
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
The concert/cafeteria queueing problem: a game of arrivals
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Cooperation in Service Systems
Operations Research
The concert queueing game: to wait or to be late
Discrete Event Dynamic Systems
A game theoretic formulation of the service provisioning problem in cloud systems
Proceedings of the 20th international conference on World wide web
Hi-index | 0.00 |
This paper shows how to apply the Aumann-Shapley price mechanism for charging customers for the congestion costs that they impose on others. The mechanism is demonstrated on a single server queue with Poisson arrivals under various queueing disciplines.