A common assumption about the players in a game is that a. Neither player knows the payoff matrix b. The players have different information about the payoff matrix c. Only one of the players pursues a rational strategy d. The specific identify of the players is irrelevant to the play of the game

A common assumption about the players in a game is that
a. Neither player knows the payoff matrix
b. The players have different information about the payoff matrix
c. Only one of the players pursues a rational strategy
d. The specific identify of the players is irrelevant to the play of the game
by

1 Answer

Answer :

d. The specific identify of the players is irrelevant to the play of the game
by

Related questions

A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called___ a. Centre point b. Main point c. Saddle point d. Equal point

Description : A situation in a game where, in the payoff matrix, maximin of row is equal to minimax of column is called___ a. Centre point b. Main point c. Saddle point d. Equal point

Last Answer : c. Saddle point

In game theory, the outcome or consequence of a strategy is referred to as the a. Payoff b. Penalty c. Reward d. End-game strategy

Description : In game theory, the outcome or consequence of a strategy is referred to as the a. Payoff b. Penalty c. Reward d. End-game strategy

Last Answer : a. Payoff

Every combination of strategies determines an outcome known as _____ a. Regret b. Payoff c. Saddle point d. Profit matrix

Description : Every combination of strategies determines an outcome known as _____ a. Regret b. Payoff c. Saddle point d. Profit matrix

Last Answer : b. Payoff

A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Description : A _______ provides a complete definition of how a player will play a game a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Last Answer : c. Complete strategy

. In a zero-sum game, a. What one player wins, the other loses b. The sum of each player’s winnings if the game is played many times must be zero c. The game is fair-each person has an equal chance of winning d. Long-run profits must be zero

Description : . In a zero-sum game, a. What one player wins, the other loses b. The sum of each player’s winnings if the game is played many times must be zero c. The game is fair-each person has an equal chance of winning d. Long-run profits must be zero

Last Answer : a. What one player wins, the other loses

A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Description : A ______ is the one in which the player selects more than one strategy with fixed probabilities before playing the game. a. Mixed strategy b. Pure strategy c. Complete strategy d. Impure strategy

Last Answer : d. Impure strategy

A strategy that is best regardless of what rival players do is called a. First-mover advantage b. A Nash equilibrium strategy c. Tit-for-tat d. A dominant strategy

Description : A strategy that is best regardless of what rival players do is called a. First-mover advantage b. A Nash equilibrium strategy c. Tit-for-tat d. A dominant strategy

Last Answer : d. A dominant strategy

A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game

Description : A ______ occurs when each player selects one of his strategies a. Profit b. Decision c. Play d. Game

Last Answer : c. Play

The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player

Description : The choice of the strategy is made by both the _________ simultaneously a. Decision maker b. Manager c. Competitor d. Player

Last Answer : Player

The participants in a game are called ______ a. Clients b. Members c. Customers d. Players

Description : The participants in a game are called ______ a. Clients b. Members c. Customers d. Players

Last Answer : d. Players

An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above

Description : An assumption that implies that finite numbers of choices are available to a decision-maker and the decision variables do not assume negative values is known as _______ a. Certainty b. Continuity c. Finite choices d. None of the above

Last Answer : c. Finite choices

42. _____ assumption means the prior knowledge of all the coefficients in the objective function , the coefficients of the constraints and the resource values a. Proportionality b. Certainty c. Finite choices d. Continuity

Description : 42. _____ assumption means the prior knowledge of all the coefficients in the objective function , the coefficients of the constraints and the resource values a. Proportionality b. Certainty c. Finite choices d. Continuity

Last Answer : b. Certainty

39. Which of the following is an assumption of an LP model a. Divisibility b. Proportionality c. Additivity d. All of the above

Description : 39. Which of the following is an assumption of an LP model a. Divisibility b. Proportionality c. Additivity d. All of the above

Last Answer : d. All of the above

The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains

Description : The various alternatives or courses of actions available to each player in a game are called as ____ a. Saddle points b. Strategies c. Pay-off d. Gains

Last Answer : b. Strategies

In a game, the alternatives or courses of action available to each player are called _____ a. Options b. Choices c. Actions d. strategies

Description : In a game, the alternatives or courses of action available to each player are called _____ a. Options b. Choices c. Actions d. strategies

Last Answer : d. strategies

An optimal solution of an assignment problem can be obtained only if a. Each row & column has only one zero element b. Each row & columns has at least one zero element c. The data is arrangement in a square matrix d. None of the above

Description : An optimal solution of an assignment problem can be obtained only if a. Each row & column has only one zero element b. Each row & columns has at least one zero element c. The data is arrangement in a square matrix d. None of the above

Last Answer : d. None of the above

If no. of rows are not equal to number of columns and the matrix elements are profit elements then the problem is: a. Balanced and Maximization Transportation problem b. Unbalanced and Maximization Transportation problem c. Balanced and Maximization Assignment problem d. Unbalanced and Maximization Assignment problem

Description : If no. of rows are not equal to number of columns and the matrix elements are profit elements then the problem is: a. Balanced and Maximization Transportation problem b. ... Transportation problem c. Balanced and Maximization Assignment problem d. Unbalanced and Maximization Assignment problem

Last Answer : a. Balanced and Maximization Transportation problem

If no. of rows are equal to number of columns and the matrix elements are Time elements then the problem is: a. Balanced and Minimization Transportation problem b. Unbalanced and Minimization Transportation problem c. Balanced and Minimization Assignment problem d. Unbalanced and Minimization Assignment problem

Description : If no. of rows are equal to number of columns and the matrix elements are Time elements then the problem is: a. Balanced and Minimization Transportation problem b. ... Transportation problem c. Balanced and Minimization Assignment problem d. Unbalanced and Minimization Assignment problem

Last Answer : c. Balanced and Minimization Assignment problem

. The method used for solving an assignment problem is called a. Reduced matrix method b. MODI method c. Hungarian method d. None of the above

Description : . The method used for solving an assignment problem is called a. Reduced matrix method b. MODI method c. Hungarian method d. None of the above

Last Answer : . c. Hungarian method

Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Description : Maximization problem, then convert into minimization table through _________ a. Row minimization b. Column minimization c. Regret matrix d. Profit matrix

Last Answer : c. Regret matrix

57. The solution space(region) of an LP problem is unbounded due to a. An incorrect formulation of the LP model b. Objective function is unbounded c. Neither a nor b d. Both a & b

Description : 57. The solution space(region) of an LP problem is unbounded due to a. An incorrect formulation of the LP model b. Objective function is unbounded c. Neither a nor b d. Both a & b

Last Answer : b. Objective function is unbounded c. Neither a nor b

34. Maximization of objective function in an L P model means a. Value occurs at allowable set of decisions b. Highest value is chosen among allowable decisions c. Neither of above d. Both a & b

Description : 34. Maximization of objective function in an L P model means a. Value occurs at allowable set of decisions b. Highest value is chosen among allowable decisions c. Neither of above d. Both a & b

Last Answer : a. Value occurs at allowable set of decision

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

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

Last Answer : d. All of the above

What is the benefit of using PERT/CPM network as integral component of project management? a. They furnish a consistent framework for planning, scheduling, monitoring and controlling project b. They illustrate the interdependencies of all tasks c. They can be used to estimate the expected project completion dates as well as the probability that the project will be completed by a specific date d. All of the above

Description : What is the benefit of using PERT/CPM network as integral component of project management? a. They furnish a consistent framework for planning, scheduling, monitoring and controlling project b. They illustrate ... that the project will be completed by a specific date d. All of the above

Last Answer : d. All of the above

Who developed the Game Theory a. J.R. Hicks b. William J. Baumol c. Neumann Morgenstern d. Samuelson P.T.

Description : Who developed the Game Theory a. J.R. Hicks b. William J. Baumol c. Neumann Morgenstern d. Samuelson P.T.

Last Answer : c. Neumann Morgenstern

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

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

8. Who defined Operations Research as an aid for the executive in marketing his decisions by providing him with the quantitative information based on the scientific method of analysis? a. C. Kitte b. H.M. Wagner c. E.L. Arnoff d. None of the above

Description : 8. Who defined Operations Research as an aid for the executive in marketing his decisions by providing him with the quantitative information based on the scientific method of analysis? a. C. Kitte b. H.M. Wagner c. E.L. Arnoff d. None of the above

Last Answer : a. C. Kitte

Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements? I. Abstraction allows us to focus on what something does without considering the complexities of how it works. II. Encapsulation allows us to consider complex ideas while ignoring irrelevant detail that would confuse us. (1) Neither I nor II is correct. (2) Both I and II are correct. (3) Only II is correct. (4) Only I is correct.

Description : Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements? I. Abstraction allows us to focus on what something ... and II are correct. (3) Only II is correct. (4) Only I is correct.

Last Answer : (1) Neither I nor II is correct.

The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.

Description : The basic difference between PERT and CPM is that a. PERT deals with events and CPM with activities b. Critical Path is determined in PERT only c. Costs are considered on CPM only d. Guessed times are used in PERT and evaluated times in CPM.

Last Answer : a. PERT deals with events and CPM with activities

What network model enables engineer managers to schedule, monitor and control large and complex projects by using only one time factor per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation

Description : What network model enables engineer managers to schedule, monitor and control large and complex projects by using only one time factor per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation

Last Answer : b. Program evaluation review technique

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

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

Last Answer : d. All of the above

63. Graphic method can be applied to solve a LPP when there are only ____ variable a. Four b. More than one c. Two d. three

Description : 63. Graphic method can be applied to solve a LPP when there are only ____ variable a. Four b. More than one c. Two d. three

Last Answer : Which oil is used in the floatation method for the purification of ores?

49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function

Description : 49. A feasible solution to an LP problem a. Must satisfy all of the problem’s constraints simultaneously b. Need not satisfy all of the constraints, only some of them c. Must be a corner point of the feasible solution d. Must optimize the value of the objective function

Last Answer : a. Must satisfy all of the problem’s constraints simultaneously

37. Which of the following is not a characteristics of the LP a. Resources must be limited b. Only one objective function c. Parameters value remains constant during the planning period d. The problem must be of minimization type

Description : 37. Which of the following is not a characteristics of the LP a. Resources must be limited b. Only one objective function c. Parameters value remains constant during the planning period d. The problem must be of minimization type

Last Answer : d. The problem must be of minimization type

What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Description : What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Last Answer : c. Imbalanced growth point

What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Description : What is a saddle point? a. Equilibrium point b. Balanced growth point c. Imbalanced growth point d. Unstable equilibrium point

Last Answer : a. Equilibrium point

In project crashing, as we systematically, crash the project, direct cost of project ______ a. Increases b. Decreases c. Remain same d. None of the above

Description : In project crashing, as we systematically, crash the project, direct cost of project ______ a. Increases b. Decreases c. Remain same d. None of the above

Last Answer : a. Increases

Floats for critical activities will be always _____ a. One b. Zero c. Highest d. Same as duration of the activity

Description : Floats for critical activities will be always _____ a. One b. Zero c. Highest d. Same as duration of the activity

Last Answer : b. Zero

An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important

Description : An activity whose start or end cannot be delay without affecting total project completion time is called ______ activity a. Dummy b. Non-critical c. Critical d. Important

Last Answer : c. Critical

Backward pass calculations are done to find ________ occurrence times of events a. Tentative b. Definite c. Latest d. Earliest

Description : Backward pass calculations are done to find ________ occurrence times of events a. Tentative b. Definite c. Latest d. Earliest

Last Answer : c. Latest

Forward pass calculations are done to find _____ occurrence times of events a. Exact b. Earliest c. Latest d. Approximate

Description : Forward pass calculations are done to find _____ occurrence times of events a. Exact b. Earliest c. Latest d. Approximate

Last Answer : b. Earliest

The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical

Description : The second longest path in the network diagram is called a. Alternate b. Feasible c. Sub-critical d. Critical

Last Answer : c. Sub-critical

Pick up the incorrect statement from the following a. The activity which consumes maximum time, is called a node b. The activity is the time consuming part of a project c. The beginning and end of a job, are called events d. Logically and sequentially connected activities and events form a network

Description : Pick up the incorrect statement from the following a. The activity which consumes maximum time, is called a node b. The activity is the time consuming part of a project c. The beginning ... of a job, are called events d. Logically and sequentially connected activities and events form a network

Last Answer : a. The activity which consumes maximum time, is called a node

In a PERT network, the earliest(activity) start time is the a. Earliest time that an activity can be finished without delaying the entire project b. Latest time that an activity can be started without delaying the entire project c. Earliest time that an activity can be started without violation of precedence requirements d. Latest time that an activity can be finished without delaying the entire project

Description : In a PERT network, the earliest(activity) start time is the a. Earliest time that an activity can be finished without delaying the entire project b. Latest time that an activity can ... of precedence requirements d. Latest time that an activity can be finished without delaying the entire project

Last Answer : c. Earliest time that an activity can be started without violation of precedence requirements

At the completion of the forward and backward passes, the slack for an activity is given by the a. Difference between early start and early finish b. Difference between early start and latest finish c. Difference between latest start and early finish d. Difference between latest start and latest finish

Description : At the completion of the forward and backward passes, the slack for an activity is given by the a. Difference between early start and early finish b. Difference between early start and ... c. Difference between latest start and early finish d. Difference between latest start and latest finish

Last Answer : c. Difference between latest start and early finish

. In what year was PERT developed? a. 1957 b. 1959 c. 1960 d. 1958

Description : . In what year was PERT developed? a. 1957 b. 1959 c. 1960 d. 1958

Last Answer : . 1957

The CPM was developed by Rand and Walker in which year? a. 1957 b. 1958 c. 1959 d. 1960

Description : The CPM was developed by Rand and Walker in which year? a. 1957 b. 1958 c. 1959 d. 1960

Last Answer : a. 1957

For a project manager to have an effective means of identifying and communicating the planned activities and their interrelationships, he must use a network technique. One of the network techniques is commonly known as PERT, what does PERT stands for? a. Project evaluation review technique b. Program evaluation review technique c. Path evaluation review technique d. Project execution review technique

Description : For a project manager to have an effective means of identifying and communicating the planned activities and their interrelationships, he must use a network technique. One of the network ... evaluation review technique c. Path evaluation review technique d. Project execution review technique

Last Answer : b. Program evaluation review technique

What network model enables engineer managers to schedule, monitor and control large and complex projects by employing three time estimates per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation

Description : What network model enables engineer managers to schedule, monitor and control large and complex projects by employing three time estimates per activity a. Forecasting b. Program evaluation review technique c. Critical path method d. simulation

Last Answer : b. Program evaluation review technique

___ is one of the fundamental combinatorial optimization problems a. Assignment problem b. Transportation problem c. Optimization problem d. None of the above

Description : ___ is one of the fundamental combinatorial optimization problems a. Assignment problem b. Transportation problem c. Optimization problem d. None of the above

Last Answer : a. Assignment problem