6.207/14.15: Networks
Problem 1.
Problem Set 2
Due: Wednesday, October 14, 2009
Consider a growing random network model generated as follows:
At each time step, k nodes (k > 1) each with degree k are born.
All k of the newborn nodes connect to each othe
6.207/14.15: Networks
Problem Set 4
Due: Friday, November 6, 2009
Problem 1. [Sudoku as a game of cooperation]
In the popular game of Sudoku, the number placement puzzle, the objective is to fill a 9 9 grid so that each
column, each row, and each of the n
6.207/14.15: Networks
Problem Set 5
Due: Wednesday, December 2, 2009
Problem 1. [Cooperation over social network]
Consider a social network, in which agents are matched pairwise at each date according to a matrix of
probabilities P (where all entries of P
6.207/14.15: Networks
Problem Set 1
Due: Monday, September 28, 2009
Problem 1.1 (Phase Transitions in the Erdos-Renyi Model)
Consider an Erdos-Renyi
random graph G (n, p).
(a) Let A l denote the event that node 1 has at least l Z + neighbors. Do we observ
6.207/14.15: Networks
Problem Set 3
Due: Wednesday, October 28, 2009
Problem 1 (Iterated Elimination of Strictly Dominated Strategies)
Consider the iterated elimination of strictly dominated strategies in the strategic form game hI , (Si )i I , (ui )i I i