For PhD as my proposals stand irt solving search models with microscopic simulation:
- Define a lattice and relevant objects (agents)
- Allow searching agents to randomly change location every period; this will give an ex ante objective probability distribution to finding other agents (trade opportunities, jobs) based on relation of searching agents to non-searching agents to lattice size etc
- Use the above method to estimate an analytically tractable search model (eg basic job-search in Pissarides (2000))
This probably won't work perfectly, as the rate at which worker find jobs/jobs find workers will become endogenous in a presumably complicated manner, which it isn't in the basic job-search model. However this is only an aesthetic problem . . . the method
should be easier (certainly more intuitive) than searching for fixed points in the parameter space, and should also improve upon these methods by allowing the balance-sheets of each individual agent to be kept track of. This will be useful in search-theoretic models of financial intermediation (my actual topic).
Things needed prior to completing the above:
Learn search-theory
- Learn object-oriented programming
- Take classes in combinatorics