Game Theory - Practice Midterm | STAT 155, Exams of Statistics

Material Type: Exam; Class: Game Theory; Subject: Statistics; University: University of California - Berkeley; Term: Fall 2004;

Typology: Exams

Pre 2010

Uploaded on 09/07/2009

koofers-user-9l0
koofers-user-9l0 🇺🇸

9 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Practice Midterm: Statistics 155 - due Oct 18, 2004
Instructor: Yuval Peres Duration: 75 minutes.
Instructions: Please write your name on every page. This examination contains three
problems with weight 34 points each. Write each answer very clearly below the corresponding
question. (Use back of page if needed). No books, notebooks or other written materials are
allowed.
Good Luck!
1. Define precisely the Sprague-Grundy function gfor a progressively finite impartial game.
Consider the game which is played with piles of chips like nim, but with the additional
move allowed of breaking one pile of size k > 0 into two nonempty piles of sizes i > 0
and ki > 0. Show that the Sprague-Grundy function gfor this game, when evaluated
at positions with a single pile, satisfies g(3) = 4. Find g(1000), that is, gevaluated at a
position with a single pile of size 1000.
Given a position consisting of piles of sizes 13, 24 and 17, how would you play?
1
pf3

Partial preview of the text

Download Game Theory - Practice Midterm | STAT 155 and more Exams Statistics in PDF only on Docsity!

Practice Midterm: Statistics 155 - due Oct 18, 2004

Instructor: Yuval Peres Duration: 75 minutes.

Instructions: Please write your name on every page. This examination contains three problems with weight 34 points each. Write each answer very clearly below the corresponding question. (Use back of page if needed). No books, notebooks or other written materials are allowed.

Good Luck!

  1. Define precisely the Sprague-Grundy function g for a progressively finite impartial game. Consider the game which is played with piles of chips like nim, but with the additional move allowed of breaking one pile of size k > 0 into two nonempty piles of sizes i > 0 and k − i > 0. Show that the Sprague-Grundy function g for this game, when evaluated at positions with a single pile, satisfies g(3) = 4. Find g(1000), that is, g evaluated at a position with a single pile of size 1000. Given a position consisting of piles of sizes 13, 24 and 17, how would you play?
  1. Find the value of the zero-sum game given by the following payoff matrix, and determine optimal strategies for both players:   8 0 6 7 2 6 3 1

 