# Complexity Explorer Santa Few Institute

## Game Theory I • Static Games

Lead instructor:

Your progress is not being saved! Enroll now or log in to track your progress or submit homework.

## All posts

Max
07 Aug 2024 10:49pm UTC
in Fundamentals of NetLogo

### Homework

Hi! I really enjoyed the tutorial and wanted to try tackle the homework. I got stuck at part 3, especially the part regarding establishing new connections, and I wanted to check the solutions but I coulndt find any solution after part 1? The titles are clickable but no file is downloaded or accessed. Any help woulde be appreciated!

Kind regards!

Niyar Prabhat Kalita
18 Apr 2024 1:22pm UTC
in Introduce Yourself

### Questions

1) For the case of shrinking steps, we have, step length ~ (lambda)^n with (lambda less than 1). Sor, for negative value of n, step length should approach infinity always, but in the plots shown in the video, P as a function of lambda goes to 0 as n tends to negative infinity. What is the reason behind that?

2) How, for the case d=0, the expression of rho becomes ln(t)?