The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | May 2017 |
| Last Sign in: | 398 Weeks Ago, 6 Days Ago |
| Questions Answered: | 66690 |
| Tutorials Posted: | 66688 |
MCS,PHD
Argosy University/ Phoniex University/
Nov-2005 - Oct-2011
Professor
Phoniex University
Oct-2001 - Nov-2016
(Removing stones) Two people take turns removing stones from a pile of n stones. Each person may, on each of her turns, remove either one stone or two stones. The person who takes the last stone is the winner; she gets $1 from her opponent. Find the subgame perfect equilibria of the games that model this situation for n = 1 and n = 2. Find the winner in each subgame perfect equilibrium for n = 3, using the fact that the subgame following player 1’s removal of one stone is the game for n = 2 in which player 2 is the first-mover, and the subgame following player 1’s removal of two stones is the game for n = 1 in which player 2 is the first mover. Use the same technique to find the winner in each subgame perfect equilibrium for n = 4, and, if you can, for an arbitrary value of n.
Â

Hel-----------lo -----------Sir-----------/Ma-----------dam-----------Tha-----------nk -----------You----------- fo-----------r u-----------sin-----------g o-----------ur -----------web-----------sit-----------e a-----------nd -----------acq-----------uis-----------iti-----------on -----------of -----------my -----------pos-----------ted----------- so-----------lut-----------ion-----------.Pl-----------eas-----------e p-----------ing----------- me----------- on-----------cha-----------t I----------- am----------- on-----------lin-----------e o-----------r i-----------nbo-----------x m-----------e a----------- me-----------ssa-----------ge -----------I w-----------ill----------- be-----------