Econ经济代写 Problem 1
(a) This is a classic matching problem. The easiest way to find the Nash equilibrium is to first eliminate from each row the dominated strategies for Harrison. Harrison has the second payoff in each pair. Looking at the first row, if Tyler chooses small (S), Harrison should also choose small. Thus the point (S,L) in the upper right-hand corner can be eliminated.
julia代码代写 Read the following text and answer the questions given in and after the text.For questions that need Julia, both codes and results should be Besides,codes need in .jl form or .ipynb form.
Ifyou are not familiar with bit operation in Julia you can refer to files ‘Julia ipynb’ or ‘Julia instruction.html’.