12 citations · 29 across the 37 of their papers we have counts for
3 papers · 1 filter
Optimal Strategies of Blotto Games: Beyond Convexity
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan +3
The Colonel Blotto game, first introduced by Borel in 1921, is a well-studied game theory classic. Two colonels each have a pool of troops that they divide simultaneously among a s…
A Polynomial Time Algorithm for Spatio-Temporal Security Games
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi +1
An ever-important issue is protecting infrastructure and other valuable targets from a range of threats from vandalism to theft to piracy to terrorism. The "defender" can rarely af…
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan +2
In the Colonel Blotto game, which was initially introduced by Borel in 1921, two colonels simultaneously distribute their troops across different battlefields. The winner of each b…