In a 2-player game the payoff function of player 1 is given by , where denotes a strategy of player 1 and a strategy of player 2.Suppose that (that is, all real values from 7 to 9, including 7 and 9) are the strategy sets of players 1 and 2, respectively.Write down the strategy of player 1 which is strongly dominant.

In a 2-player game the payoff function of player 1 is given by u subscript 1 left parenthesis s subscript 1 comma s subscript 2 right parenthesis equals left parenthesis 4 minus s subscript 1 right parenthesis s subscript 2 plus 8, where s subscript 1 denotes a strategy of player 1 and s subscript 2 a strategy of player 2. Suppose that S subscript 1 equals S subscript 2 equals left square bracket 7 comma 9 right square bracket (that is, all real values from 7 to 9, including 7 and 9) are the strategy sets of players 1 and 2, respectively. Write down the strategy of player 1 which is strongly dominant. You must format your answer as follows: Enter 8 for strategy s subscript 1 equals 8, enter 8.5 for strategy s subscript 1 equals 8.5, and so on. If none of player 1's strategies is strongly dominant, enter negative 1.

For a player in a game, a dominant strategy isGroup of answer choicesAll of the other answers are correctthe strategy that maximises the joint payoff of players in the game.When all players adopt the same strategywhen a player adopts the same strategy, regardless as to the strategies of any other players in the gameNone of the other answers are correct

The payoff value for which each player in a game always selects the same strategy is called the

Table 17-16This table shows a game played between two players, A and B. The payoffs are given in the table as (Payoff to A, Payoff to B).    B    LeftCenterRight  Up(8, 4)(4, 10)(6, 6)AMiddle(6, 2)(10, 6)(10, 4)  Down(2, 6)(8, 8)(12, 2)Refer to Table 17-16. Which of the following statements is true regarding this game?Group of answer choicesBoth players have a dominant strategy.Neither player has a dominant strategy.A has a dominant strategy, but B does not have a dominant strategy.B has a dominant strategy, but A does not have a dominant strategy.

Consider the two player game described by the payoff matric below.  L RU 3,3 2,xD 2,3 1,2What value must x NOT BE for the iterative elimination of strongly dominated strategies to lead to a single outcome?  Write your answer as an integer (e.g. 5).