Two player problem of points set up - game theory, Game Theory

a) Show that

259_Two player Problem of Points set up 1.png

A counting proof could be fun(?). But any old proof will do.

(Note that the coefficients (1,2,1) in the above are just the elements of the second row of Pascal's triangle. In general, if you take any row of Pascal's triangle and apply all of the coefficients to adjacent entries of a later row in the table, you will get another entry in Pascal's triangle. You don't have to prove this).

b) Not connected to part a) above (I don't think). Consider the two player Problem of Points set up, where the game consists of n rounds, and where player A has won a rounds and Player B has won b rounds (a, b < n)whentheyareforcedtoquit.Let r =2n - 1 - (a + b). Show that according to the Pascal-Fermat solution, the ratio of A's share of the pot to B's share of the pot should be:

1789_Two player Problem of Points set up 2.png

That is, all you need is the r'th row of Pascal's Triangle to get the split of the pot, as pointed out by Pascal.

Posted Date: 3/30/2013 5:11:53 AM | Location : United States

Related Discussions:- Two player problem of points set up - game theory, Assignment Help, Ask Question on Two player problem of points set up - game theory, Get Answer, Expert's Help, Two player problem of points set up - game theory Discussions

Write discussion on Two player problem of points set up - game theory
Your posts are moderated
Related Questions
Consider two quantity-setting firms that produce a homogeneous good. The inverse demand function for the good is p = A - (q 1 +q 2 ). Both firms have a cost function C = q 2 (a

An auction during which many (more than one) things are offered for sale. Mechanisms for allocating multiple units embody discriminatory and uniform worth auctions.

A strategy sometimes applied to repeated prisoner's dilemmas during which a player begins by cooperating however defects to cheating for a predefined amount of your time as a respo

A class of games of imperfect data during which one player (the principal) tries to supply incentives to the opposite (the agent) to encourage the agent to act within the principal

1. (a) True or False: If a 2x2 game has a unique pure strategy Nash Equilibrium, then both players always have dominant strategies. (b) Draw a table representing the Prisoner.s Dil

Rollback (often referred to as backward induction) is an iterative method for solving finite in depth kind or sequential games. First, one determines the optimal strategy of the pl

1  A, Explain how a person can be free to choose but his or her choices are casually determined by past event 2  B , Draw the casual tree for newcomb's problem when Eve can't pe

Consider a game in which player 1 chooses rows, player 2 chooses columns and player 3 chooses matrices. Only Player 3''s payoffs are given below. Show that D is not a best response

Cardinal payoffs are numbers representing the outcomes of a game where the numbers represent some continuum of values, such as money, market share or quantity. Cardinal payoffs per