Large Markov decision processes and combinatorial optimisation. Markov decision processes continue to gain in popularity for modelling a wide range of applications ranging from analysis of supply chains and queueing networks to cognitive science and control of autonomous vehicles. Nonetheless, they tend to become numerically intractable as the size of the model grows fast. Recent works use machine learning techniques to overcome this crucial issue, but with no convergence guarantee. This project ....Large Markov decision processes and combinatorial optimisation. Markov decision processes continue to gain in popularity for modelling a wide range of applications ranging from analysis of supply chains and queueing networks to cognitive science and control of autonomous vehicles. Nonetheless, they tend to become numerically intractable as the size of the model grows fast. Recent works use machine learning techniques to overcome this crucial issue, but with no convergence guarantee. This project aims to provide theoretically sound frameworks for solving large Markov decision processes, and exploit them to solve important combinatorial optimisation problems. This timely project can promote Australia's position in the development of such novel frameworks for many scientific and industrial applications.Read moreRead less
Perturbations in Complex Systems and Games. This project aims to: advance the perturbation theory of dynamic and stochastic games; further develop approximations of infinite dimensional linear programs by their finite dimensional counterparts, and by finding asymptotic limits of spaces of occupational measures, by solution of successive layers of fundamental equations; explain and quantify the "exceptionality" of instances of systems that are genuinely difficult to solve; and, capitalise on the ....Perturbations in Complex Systems and Games. This project aims to: advance the perturbation theory of dynamic and stochastic games; further develop approximations of infinite dimensional linear programs by their finite dimensional counterparts, and by finding asymptotic limits of spaces of occupational measures, by solution of successive layers of fundamental equations; explain and quantify the "exceptionality" of instances of systems that are genuinely difficult to solve; and, capitalise on the outstanding performance of our Snakes-and-Ladders Heuristic (SLH) for the solution of the Hamiltonian cycle problem to identify its "fixed complexity orbits" and generalise this notion to other NP-complete problems.Read moreRead less