Name
Title | ||
|---|---|---|
Individually and socially optimal joining rules for an egalitarian processor-sharing queue under different information scenarios. |
Abstract | ||
|---|---|---|
•Optimal joining rules for processor-sharing queue under different information levels are considered.•Employing left-multiplication transformation, the expected conditional sojourn time is obtained.•Socially optimal threshold is no longer a lower bound for the individually optimal threshold.•Equilibrium and socially optimal mixed strategies are derived in fully unobservable case. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.cie.2014.09.022 | Computers & Industrial Engineering |
Keywords | Field | DocType |
Queueing,Processor-sharing,Joining rules,Conditional sojourn time | Mathematical optimization,Upper and lower bounds,Computer science,Queue,Processor sharing,Queueing theory,Nash equilibrium,Unobservable,Matrix representation,Operations management,The Internet | Journal |
Volume | ISSN | Citations |
78 | 0360-8352 | 3 |
PageRank | References | Authors |
0.40 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miaomiao Yu | 1 | 55 | 6.13 |
| Yinghui Tang | 2 | 7 | 2.85 |
| Wenqing Wu | 3 | 5 | 1.12 |