a) Show that

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:

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

Ask an Expert

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

Write your message here..

Related Questions

Fixed worth auction, Not technically an auction, however a posted-price pro... Not technically an auction, however a posted-price procedure during which the auctioneer sets a worth and sells to the primary bidder willing to pay it. The auction ends as soon as

Payoffs, mixed strategy game with ordinal and cardinal payoffs example plea... mixed strategy game with ordinal and cardinal payoffs example please

Blind auction, Another term for a preserved bid auction in which bidders si... Another term for a preserved bid auction in which bidders simultaneously submit bids to the auctioneer with no knowledge of the amount bid by other member. Usually, the uppermost b

Sequential game, A sequential game is one during which players build choice... A sequential game is one during which players build choices (or choose a strategy) following an exact predefined order, and during which a minimum of some players will observe the

Strategy, A strategy defines a collection of moves or actions a player can ... A strategy defines a collection of moves or actions a player can follow in a very given game. a method should be complete, defining an action in each contingency, together with peo

Ship, Ship, Captain and Crew (sometimes called Ship, Captain and Mate) was ... Ship, Captain and Crew (sometimes called Ship, Captain and Mate) was a popular bar game played for drinks with five dice and throwing cup. Each player gets three throws. He has to

Ordinal payoffs, Ordinal payoffs are numbers representing the outcomes of a... Ordinal payoffs are numbers representing the outcomes of a game where the worth of the numbers isn't vital, however solely the ordering of numbers. for instance, when solving for a

Nash equilibrium, Consider a game in which player 1 chooses rows, player 2 ... 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

Find all ne of the game, 1. Find all NE of the following 2×2 game. Determin... 1. Find all NE of the following 2×2 game. Determine which of the NE are trembling-hand perfect. 2. Consider the following two-person game where player 1 has three strategie

Games with strategic moves, Games with Strat e gic M ov es   ... Games with Strat e gic M ov es   The ideas in this chapters can be brought to life and the students can better appreciate the subtleties of various strategic moves an