9 papers
Offline Nash Solvers Meet Online Tree Search in Multi-Agent Games on Graphs
Mukesh Kumar, Yue Guan, Panagiotis Tsiotras
Computing Nash equilibrium policies in multi-agent Pursuit-Evasion games (PEG) is challenging due to the exponential growth of the joint state and action spaces with the number of…
Performance-Driven Environment Abstraction with Multi-Timescale Learning
Yue Guan, Dipankar Maity, Panagiotis Tsiotras
We study performance-driven environment abstraction for decision-making in large Markov decision processes. Rather than preserving geometric or topological structure, we seek abstr…
Linear Programming Approach to Deceptive Path Planning Game with Goal Selection
Violetta Rostobaya, Yue Guan, James Berneburg +1
In adversarial settings, a mobile agent may strategically plan its motion to influence an opponent's inference about its intended goal. We study deceptive path planning in a scenar…
Nonlinear Stochastic Density Steering via Gaussian Mixture Schrodinger Bridges and Multiple Linearizations
Mattia Mosso, George Rapakoulias, Yue Guan +1
The paper studies the optimal density steering problem for nonlinear continuous-time stochastic systems. To accurately capture nonlinear dynamics in high-uncertainty regions that d…
Dynamic Adversarial Resource Allocation: the dDAB Game
Yue Guan, Daigo Shishika, Jason R. Marden +3
This work introduces the dynamic Defender-Attacker Blotto (dDAB) game, extending the classical static Blotto game to a dynamic resource allocation setting over graphs. In the dDAB…
Strategic Concealment of Environment Representations in Competitive Games
Yue Guan, Dipankar Maity, Panagiotis Tsiotras
This paper investigates the strategic concealment of environment representations used by players in competitive games. We consider a defense scenario in which one player (the Defen…