İŞLETME KARAR MODELLERİ - Deneme Sınavı - 7

A state with a self-loop transition is always aperiodic.

Players can be individuals, organizations, teams or, in some cases, nature itself. The
number of players must be finite and must be known.

A pure strategy is an unconditional decision always to select a particular course of action. For example, in the game of Rock-PaperScissors, if a player would choose to only play Rock for each interdependent trial, regardless of the other player’s strategy, it would be the player’s pure strategy.

Hawk-Dove: Hawk-Dove game, is also known as The Game of Chicken is an example of conflict for two players in the game theory. Two animals are fighting for some prey. An animal that plays the strategy Hawk (H) behaves aggressively, while the other one plays the strategy Dove (D) behaves passively.

A game is defined to be any situation in which
• There are at least two players,
• Each player has a finite number of strategies,
• Each player’s chosen strategies determine the outcome of the game,
• Each player acts rationally to maximize his/her gains,
• The different strategies of each player and the amount of gain is known to each player in advance.

If the value of a game is zero, then it is called a fair game

A rational player never plays a dominated strategy.

The steps of the method for solving m×2 games are as follows:
Step 1. Draw two vertical axes one unit apart. These two lines are 0 and 1.
Step 2. Take the probabilities of the two alternatives of the column player as q and (1-q), then expected pay-offs of row player for each strategy are expressed with equations.
Step 3. These equations are then plotted on the graph.
Step 4. Draw n straight lines for j=1, 2… n and determine the lowest point of the upper envelope obtained. This will be the minimax point.
Step 5. The two or more lines passing through the minimax point determines the reduced 2 x 2 payoff matrix. The optimum solution of the game is obtained as in 2 x 2 game.

The row player must choose 1 of m strategies and the column player must choose 1 of n strategies, simultaneously.

In symmetric games, all players have the same actions and even in case of interchanging players, the actions of players remain the same. The other words,
the actions in a symmetric game depend on the strategies used, not on the players of the game.

A constant-sum game is a game of total conflict and the sum of total possible winnings
remains constant no matter what actions the players take. Poker, for example, is a constant-sum game because the player compete for a constant sum of money, though its distribution shifts in the course of play. The decisions of each players do not affect
the available winningsç.

The concept of linear programming and its solution method “simplex” was first introduced by George Dantzig.

In a linear program, the optimum solution is at one of the corners of the feasible region, i.e., the solution space.

The number of basic solutions can be calculated with this equation.

The variables that are set to zero are called non-basic variables.

The corner points E and F are infeasible, as they do not meet the non-negativity constraints of the augmented model.

If two corner-point feasible solutions are connected by a line segment, these corner- point feasible solutions are adjacent.

If there isn't a better CPF solution iteration is not applied.

The dual of a balanced transportation problem is interpreted as a problem of a counterpart who provides an alternative to transportation. The decision variables of the dual model are the prices of the alternative service offered by the counterpart actor. The correct answer is A.

Least-cost Method: The Least-cost method considers the respective costs of the variables so as to find a basic feasible solution that approximates the optimum solution more. Unlike the Northwest Method, the Leastcost algorithm begins with selecting the route that has the smallest unit cost of transportation. If there is more than one variable that has the smallest cost, any variable among these can be selected arbitrarily. The value allocated to the selected route is the greater one of the values of the supply and demand. The satisfied column (corresponding demands) or row (corresponding supplies) is masked out with grey and ignored for the next allocations. Next, subtract the allocation value from the supply and demand and repeat the same allocation process with the remainders of the supply and demand. The process continues until the last row or column is satisfied. The correct answer is C.