|
| 1 | +Contributing |
| 2 | +============ |
| 3 | + |
| 4 | +Team |
| 5 | +---- |
| 6 | + |
| 7 | +---- |
| 8 | +BDFL |
| 9 | +---- |
| 10 | + |
| 11 | +`Philipp Eisenhauer <https://github.com/peisenha>`_ |
| 12 | + |
| 13 | +---------------- |
| 14 | +Development Lead |
| 15 | +---------------- |
| 16 | + |
| 17 | +`Maximilian Blesch <https://github.com/MaxBlesch>`_ |
| 18 | + |
| 19 | +------------ |
| 20 | +Contributors |
| 21 | +------------ |
| 22 | + |
| 23 | +`Sebastian Becker <https://github.com/sebecker>`_, `Pascal Heid <https://github |
| 24 | +.com/Pascalheid>`_ |
| 25 | + |
| 26 | + |
| 27 | +Master Theses |
| 28 | +------------- |
| 29 | + |
| 30 | +Below you find a list with past Master Theses, that used ruspy. If you think of using |
| 31 | +ruspy in your Master Thesis, please reach out to us and view the issues with a |
| 32 | +Master-Thesis tag on `github. <https://github.com/OpenSourceEconomics/ruspy/issues>`_ |
| 33 | + |
| 34 | +------------------------------------------------------ |
| 35 | +Decision rule performance under model misspecification |
| 36 | +------------------------------------------------------ |
| 37 | +by `Maximilian Blesch <https://github.com/MaxBlesch>`_ |
| 38 | + |
| 39 | +I incorporate techniques from distributionally robust optimization into a dynamic |
| 40 | +investment model. This allows to explicitly account for ambiguity in the decision- |
| 41 | +making process. I outline an economic, mathematical, and computational model |
| 42 | +to study the seminal bus replacement problem (Rust, 1987) under potential model |
| 43 | +misspecification. I specify ambiguity sets for the transition dynamics of the model. |
| 44 | +These are based on empirical estimates, statistically meaningful, and computation- |
| 45 | +ally tractable. I analyze alternative policies in a series of computational exper- |
| 46 | +iments. I find that, given the structure of the model and the available data on |
| 47 | +past transitions, a policy simply ignoring model misspecification often outperforms |
| 48 | +its alternatives that are designed to explicitly account for it. |
| 49 | + |
| 50 | + |
| 51 | +--------------------------------------------------------------------------------- |
| 52 | +Mathematical Programming with Equilibrium Constraints: An Uncertainty Perspective |
| 53 | +--------------------------------------------------------------------------------- |
| 54 | +by `Pascal Heid <https://github.com/Pascalheid>`_ |
| 55 | + |
| 56 | +This thesis explores to which extent the Nested Fixed Point Algorithm (NFXP) as |
| 57 | +suggested by Rust (1987) differs from the Mathematical Programming with Equilibrium |
| 58 | +Constraints as introduced by Su and Judd (2012) by revisiting the Optimal Bus Engine |
| 59 | +Replacement Problem posed by the previous author. While previous studies focus on |
| 60 | +quantitative measures of speed and convergence rate, my focus lies on how the two |
| 61 | +approaches actually recover the true model when the simulation setup is less clean |
| 62 | +and more closely to what applied researchers typically face. For this comparison I |
| 63 | +draw on some techniques from the Uncertainty Quantification literature. I run a large |
| 64 | +scale simulation study in which I compare the two approaches among different model |
| 65 | +specifications by checking how accurate their counterfactual demand level predictions |
| 66 | +are. I can show that under realistic circumstances, the two approaches can yield |
| 67 | +considerably different predictions suggesting that they should be regarded as |
| 68 | +complements rather than competitors. |
0 commit comments