Advanced Game Theory, Matrix Analysis, And Optimization Techniques

Preview 2 of 3 pages

See the first 2 pages exactly as they appear in the document.

Page 1
Read page 1 as text
Advanced Game Theory, Matrix Analysis, and Optimization Techniques 1) How do you determine the eigenvalues and eigenvectors in a given matrix? What steps are involved in approximating the eigenvector, and how are Shapley values used to rationalize the payoff in a multi - player scenario? A and B are definitions. The first step in C is to find the real eigenvalues. There is only one. Because we used an approximate value for the eigenvalue, our e igenvector will not be perfect. As a first approximation, notice that 34/18 = 17/9, so choose x 3 = 9 From the second row, this makes x 2 = 17 From the first row, this makes x 1 = 48 Normalizing this eigenvector gives the weights D is a rationalization involving Shapley value calculations. It should be obvious that each miner will have the same value and payoff. 2) How does Floyd’s algorithm work, and what are the steps for applying it in the current assignment? How do you present the results of this method and discuss the implications of the findings? A is just references. B uses Floyd’s method exactly like the first assignment.
Page 2

1 more page in the full document

Unlock it once and it stays in your library, ready to chat with or turn into flashcards.