Determining the least expensive path for a new subway line underneath a metropolis like New York City is a colossal planning challenge—involving thousands of potential routes through hundreds of city ...

This paper develops methods to solve for optimal discretionary policies and optimal commitment policies in rational expectations models. These algorithms, which allow the optimization constraints to ...

For non-planar graphs, such solutions are computationally intractable," explained the researchers. The algorithm relies on the Kac-Ward formalism, a mathematical method that allows exact computation ...

Kate Smith-Miles receives funding from the Australian Research Council as a Georgina Sweet Australian Laureate Fellow, and as a Chief Investigator in the Australian Centre of Excellence in ...