Prev: X4 Next: X6
Back to midtern page: Link, final page: Link

# X5 Practice Exam Problems

📗 Enter your ID (the wisc email ID without @wisc.edu) here: and click (or hit enter key)
📗 The same ID should generate the same set of questions. Your answers are not saved when you close the browser. You could print the page: , solve the problems, then enter all your answers at the end. 
📗 Please do not refresh the page: your answers will not be saved. 

# Warning: please enter your ID before you start!


# Question 1


# Question 2


# Question 3


# Question 4


# Question 5


# Question 6


# Question 7


# Question 8


# Question 9


# Question 10


# Question 11


# Question 12


# Question 13


# Question 14


# Question 15


📗 [4 points] In GoogSoft, software engineers A and B form a two-person team. Their year-end bonus depends on their relative performance. The bonus outcomes are summarized in the following table. The value of slacking to each person is \(s\) = . The total payoff to each person is the sum of the bonus and the value from slacking. What is the smallest value of \(x\) such that both players will work hard in a Nash equilibrium?
- B works hard B slacks
A works hard \(x, x\)
A slacks

📗 Answer: .
📗 [4 points] There are people living in the suburbs and all of them commute to work in the city. Every morning, each individual decides which way to drive to the city simultaneously: the Direct Way or the Long Way. The Long Way takes 1 hour of driving. The time spent on the Direct Way depends on the traffic is equal to \(\dfrac{n}{c}\) hours, where \(n\) is the total number of cars taking the Direct Way, and \(c\) = is the capacity. Each individual wants to minimize the driving time, and break ties by choosing the Direct Way. What is the number of people taking the Long Way in the Nash equilibrium?
📗 Answer: .
📗 [3 points] \(N\) = firms sharing the use of a river decide whether to filter (F) or release (R) pollutants (a poisonous substance) into the river. If \(n\) firms choose to pollute the river (R), each of these \(n\) firms incurs a cost of dollars, and each of the remaining firms that choose to install filters (F) incurs a cost of (cost due to pollution plus the cost of the filter). Every firm wants to minimize costs. What is the number of firms that choose to install filters (F) in a pure strategy Nash equilibrium? Note: remember to enter an integer. 
📗 Answer: .
📗 [4 points] Imagine a population of \(N\) = individuals. Each of them simultaneously chooses between taking the vaccine and not. All individuals have the same payoffs. Suppose there are \(n\) people who choose not to take the vaccine, then the payoff from not taking the vaccine is \(- \alpha \cdot \dfrac{n}{N}\), and the payoff from taking the vaccine is \(- c - \beta \cdot \dfrac{n}{N}\), \(\alpha\) = is the herd immunity coefficient, \(\beta\) = measures the ineffectiveness of the vaccine, and \(c\) = is the cost of getting the vaccine. In a Nash equilibrium, what is the largest number of individuals who choose NOT to take the vaccine?
📗 Note: \(n\) is the number of people NOT taking the vaccine, and the question is asking for the largest number of individuals who choose NOT to take the vaccine.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .
📗 [1 points] Blank.
📗 Answer: .

# Grade


 * * * *

 * * * * *


📗 You could save the text in the above text box to a file using the button or copy and paste it into a file yourself .
📗 You could load your answers from the text (or txt file) in the text box below using the button . The first two lines should be "##x: 5" and "##id: your id", and the format of the remaining lines should be "##1: your answer to question 1" newline "##2: your answer to question 2", etc. Please make sure that your answers are loaded correctly before submitting them.







Last Updated: November 18, 2024 at 11:43 PM