Each participant of the game is called...................
a. Strategist
b. Winner
c. Player
d. Loser

1 Answer

Answer :

c. Player

Related questions

Description : Tom volunteered to be the chief organizer for the world's tether ball championships. There were 657 contestants from around the world. The tournament was set up whereby the winner would advance and ... round. How many matches will Tom have to schedule to determine the tether ball champion? -Riddles

Last Answer : 656 matches will be needed.

Description : Which of the following is an assumption of game theory? a. The players act rationally and intelligently b. Each payer has a finite set of possible courses of action c. The players attempt to maximise gains or minimises losses d. All of the above

Last Answer : d. All of the above

Description : Why doesn't the winner of the primary ever ask the loser to become their vice-president?

Last Answer : Usually they are looking for someone that will add new supporters to their campaign. A governor that will bring in a critical state or something like that. Opponents in the primaries tend to have ... convince the electorate that their fully on board with your agenda. Still they are viable choices.

Description : What are your feelings about the IPO of Candy Crush? Winner or loser?

Last Answer : answer:Doomed to failure. Although this particular game is (or perhaps WAS) a hit, there is no track record of them building games (or for that matter, a corporation) for the long term. They have one product. ... iffy, at best. I wouldn't put a cent on their IPO unless I was content to lose it all.

Description : This is NOT a sports question. What is the difference between a "winner" and a "loser"?

Last Answer : Because some people care about more than whether they’re winning or losing – because some of us care that others are losing in what they don’t have and we find that to be unfair.

Description : Capitalism operates in an essentially competetive field,the winner wins - the loser loses.Does anyone know of any better ways, or is this it?

Last Answer : What could be better than survival of the fittest?

Description : When all the players of the game follow their optimal strategies, then the expected pay off of the game is called....................... a. Gain of the game b. Loss of the game c. Value of the game d. None of these

Last Answer : c. Value of the game

Description : Game theory became popular when the book “Theory of Games and Economic Behaviour” was published in 1944 by .............................. a. Von Neumann b. Mc Closky c. Von-Neumann and Mc Closky d. Von-neumann and Morgenstern

Last Answer : d. Von-neumann and Morgenstern

Description : Queuing theory is also termed as ............................ a. Game theory b. Replacement theory c. Waiting line theory d. None of these

Last Answer : c. Waiting line theory

Description : In a ........................game the amounts won by all winners together is equal to the sum of the amounts lost by all losers together. a. Non-zero sum game b. Zero sum game c. Rectangular game d. None of these

Last Answer : b. Zero sum game

Description : A game is said to be fair if the value of the game is......................... a. One b. Two c. Three d. Zero

Last Answer : d. Zero

Description : The outcome of a game is known as.................... a. Profit b. Loss c. Pay off d. None of these

Last Answer : c. Pay off

Description : ............................is known as father of game theory. a. Von Neumann b. A K Erlang c. George b Dantzig d. Arnoff

Last Answer : a. Von Neumann

Description : ....................... is an important Operations Research Technique to analyse the queuing behaviour. a. Game theory b. Waiting line theory c. Decision theory d. Simulation

Last Answer : b. Waiting line theory

Description : The O R technique which helps in minimising total waiting and service cost is: a. Game theory b. Queuing theory c. Both a and b d. Decision theory

Last Answer : b. Queuing theory

Description : ............................... is used to imitate an operation prior to actual performance. a. Inventory control b. Simulation c. Game theory d. Integrated Production Model

Last Answer : b. Simulation

Description : ....................... deals with the concepts such as critical path, float, events, etc. a. Game theory b. Decision theory c. Queuing theory d. Network analysis

Last Answer : d. Network analysis

Description : ......................... deals with making sound decisions under conditions of certainty, risk and uncertainty. a. Game theory b. Network analysis c. Decision theory d. None of these

Last Answer : c. Decision theory

Description : Before formulating a formal L P model, it is better to: a. Verbally identify decision variables b. Express the objective function in words c. Express each constraint in words d. All of the above

Last Answer : d. All of the above

Description : The assignment problem is: a. Requires that only one activity be assigned to each resource b. Is a special case of transportation problem c. Can be used to maximise resource d. All the above

Last Answer : d. All the above

Description : Controllable variables are also called.................................. a. Slack variables b. Surplus variables c. Artificial variable d. Decision variables

Last Answer : d. Decision variables

Description : The variables which cannot be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : b. Uncontrollable variables

Description : The variables which can be manipulated by the decision maker are called.................... a. Controllable variables b. Uncontrollable variables c. Both a and b d. None of these

Last Answer : a. Controllable variables

Description : The outlet where the services are being provided to the customers is called................. a. Waiting line b. Service facility c. Idle facility d. Traffic intensity

Last Answer : b. Service facility

Description : VAM is also called........................ a. Matrix Minima Method b. Penalty Method c. MODI Method d. None of these

Last Answer : b. Penalty Method

Description : Shadow price is also called ...................... a. Dual price b. Unit price c. Total cost d. None of these

Last Answer : a. Dual price

Description : Traffic intensity in Queuing Theory is also called........................... a. Service factor b. Arrival factor c. Utilisation factor d. None of these

Last Answer : c. Utilisation factor

Description : MODI Method to test the optimality of a feasible solution to TP is also called............... a. Stepping Stone Method b. u. v. Method c. both a and b d. none of these

Last Answer : b. u. v. Method

Description : Matrix Minima Method to find initial feasible solution to a TP is also called ....................... a. NWCM b. LCM c. VAM d. None of these

Last Answer : c. VAM

Description : A customer’s behaviour of jumping from one queue to another is called ............................ a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : a. Jockying

Description : A customer’s behaviour of leaving the queue due to impatience is called ....................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : b. Reneging

Description : a customer’s behaviour of leaving the queue when he does not like to wait in the queue due to lack of time or space is called ..................... a. Jockying b. Reneging c. Collusion d. Balking

Last Answer : d. Balking

Description : The ration between mean arrival rate and mean service rate is called ................... a. Idle period b. Average length of queue c. Traffic intensity d. None of these

Last Answer : c. Traffic intensity

Description : Number of customers in the queue per unit of time is called ...................... a. Queuing system b. Length of queue c. Average length of queue d. None of these

Last Answer : c. Average length of queue

Description : A matrix which shows the gains and losses resulting from moves and counter moves is called.................................. a. Cost matrix b. Pay off matrix c. Both a and b d. None of these

Last Answer : b. Pay off matrix

Description : Activities that cannot be started until one or more of the other activities are completed, are called.......................................... a. Dummy activities b. Initial activities c. Successor activities d. Predecessor activities

Last Answer : c. Successor activities

Description : Activities lying on critical path are called ............................ a. Critical activities b. Non-critical activities c. Dummy activities d. None of these

Last Answer : a. Critical activities

Description : An activity which does not consume either resource or time is called ............................. a. Predecessor activity b. Successor activity c. Dummy activity d. Terminal activity

Last Answer : c. Dummy activity

Description : An activity which must be completed before commencement of one or more other activities is called................................. a. Successor activity b. Predecessor activity c. Dummy activity d. None of these

Last Answer : b. Predecessor activity

Description : The allocated cells in the transportation table are called .............................. a. Occupied cells b. Empty cells c. Unoccupied cells d. None of these

Last Answer : a. Occupied cells

Description : While solving a LPP graphically, the area bounded by constraints is called ................. a. Feasible region b. Infeasible region c. Unbounded region d. None of these

Last Answer : a. Feasible region

Description : Every Linear Programming Problem is related to another Linear Programming Problem, called .......................... a. Primal b. Dual c. Non-linear Programming d. None of these

Last Answer : b. Dual

Description : The variables whose coefficient vectors are unit vectors, are called ...................... a. Unit variables b. Basic variables c. Non-basic variables d. None of these

Last Answer : b. Basic variables

Description : Probabilistic models are also called ........................... a. Deterministic models b. Dynamic models c. Stochastic models d. None of these

Last Answer : c. Stochastic models

Description : .........................are called mathematical models. a. Iconic models b. Symbolic models c. Analogue models d. None of these

Last Answer : b. Symbolic models

Description : If a simplex table shows the values 2, -3, 0 against “θ”, which should be taken as the replacement ratio. a. 2 b. -3 c. 0 d. None of these

Last Answer : c. 0

Description : .................... is the popular method for solving an assignment problem. a. Hungarian Method b. Enumeration Method c. Simplex Method d. None of the above

Last Answer : a. Hungarian Method

Description : Hungarian method was developed by ........................ a. T C Koopman b. F L Hitchcock c. D Konig d. George B Dantzig

Last Answer : c. D Konig

Description : Which of the following methods is used to solve an assignment problem: a. Enumeration Method b. Hungarian Method c. Simplex Method d. All of the above

Last Answer : d. All of the above

Description : Transportation model was first introduced by ........................ in the year 1941. a. T C Koopman b. George B Dantzig c. Von-neumann d. F L Hitchcock

Last Answer : d. F L Hitchcock