English to Greek Science Mathematics & Statistics μη παρατηρήσιμες ουρές αναμονής

6. Finite buffer
Lin and Ross [109] considered a queueing system with a waiting area
(or buffer) of bounded size.
[...]To illustrate such models, Lin and Ross considered an M/M/1/1 system,
namely a single server system with no waiting room. The service
value is R, and without loss of generality assume that the time value is
C = 0.11
[...]A strategy is characterized by the probability p that a customer tries.
The effective trial rate is then λ = pΛ and the server is idle with probability
μ /μ+pΛ. The (expected) payoff for one who tries is therefore Rμ/μ + pΛ − T. (3.8)
Clearly, this is an ATC situation and therefore there exists a unique
equilibrium. By (3.8), if Λ < μR−T /T , then regardless of what the others
do, one’s best action is to try (in other words, trying is a dominant
strategy). Otherwise, no dominant strategy exists. If p = μR−T/TΛ then
a customer is indifferent between trying or not.