170 likes | 283 Vues
This study explores path selection in motion-based games using game-theoretic approaches. The research investigates various strategies such as Regret Minimization (RM), Horizon-Regret Minimization (HorizonRM), Max-Min (MM), and their derivatives. The framework is validated through experiments in Bomberman, where players navigate, drop bombs, and aim to survive. The findings include performance comparisons in both 1-on-1 and Free-for-All scenarios, assessing the efficacy of traditional and new strategies. The results provide insights into strategic decision-making in dynamic game environments.
E N D
Game-Theoretic Selection of Paths in Motion-based Games Joseph Jaeger Dr. Kostas Bekris Andrew Kimmel 1 August 2013
Game Theory Game Theory Max-Min (Shoham & Leyton-Brown 2009) Regret Minimization (Halpern & Pass 2012)
Motion-based Games Motion-based Games Motion Planning
Benchmark Game: Bomberman Actions: Move around and drop bombs to destroy the environment/other agents Goal: Be the last agent not destroyed by a bomb
Variation Random Goals Periodic Bomb Placement Continuous Environments
Strategies & Experiments Stategies Regret-Min (RM) Horizon-Regret-Min (HorizonRM) Max-Min (MM) Horizon-Max-Min (HorizonMM) Greedy Greedy-Avoidance (GA) Experiments 1-on-1 Free-for-All (4 Player and 8 Player)
NewExperiments New Strategies RM+ HorizonRM+ MM+ HorizonMM+ Prior Strategies RM HorizonRM MM HorizonMM Greedy GA