Best Response Algorithms are a classical approach to multiagent design. We examine and optimize the guarantees for a one-round walk in resource allocation games.
Game Theory
Order has significant effects on the runtime of the greedy algorith min limited information scenarios. We examine the worst case guarantees in this paper.
Submodular Optimization
We derive fundamental notions of control barrier functions using comparison systems and develop some useful converse theorems.
SafetyNonlinear Control
Most multiagent scenarios without full utility alignment do not have Nash equilibrium guarantees. We explore an alternative solution concept to reason about these scenarios.
We employ tools from control barrier functions to generate nonlinear controllers that ensure safety as robotic vehicles navigate through a roundabout.
We examine the effect of uncertainty on the resulting behavior of Nash equilibrium in resource allocation games.
