Achievement

Daniel Ayala's research compares vehicular parking to a game in which vehicles (players) can be viewed as competing for parking slots (resources with different costs). Using this idea of competition, he developed a game-theoretic framework to analyze parking situations using algorithms that choose parking slots ideally in competitive parking simulations. He also developed algorithms for incomplete information contexts and showed how these algorithms even outperform algorithms with complete information in some cases. Daniel was invited to present his paper at the MDM conference being held in India this summer.