(a) Game theory problems that have 3 strategies (for player A) can be solved by

Question

(a) Game theory problems that have 3 strategies (for player A) can be solved by graphing the game. (b) Two key inputs for queueing models are the distributions (and underlying parameters) for inter-arrival times and service times. (c) Dynamic Programming can be used on problems that can be decomposed into stages and states. (a) The 'memoryless' property exists when arrivals & departures follow A. B. C. D. a normal distribution a uniform distribution either A and B - depends on the problem none of the above (b) Queue models are typically defined by: A. B. C. A single, 3-part notation, such as: M/M/1 A double, 3-part notation, such as: M/M/10/oo/tbd None of the above

Explanation / Answer

(a)The 'memoryless' property exists when arrivals & departures follow:

Ans: None of the above. Only exponential distribution and geometric distributions can have the 'memoryless' property.

(b) Queue models are typically defined by:

Ans : A single, 3-part notation, such as : M/M/1. It specifies the arrival process/servicetime distribution/no. of servers

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.