Cite
When Simple is Near Optimal in Security Games
MLA
Jalota, Devansh, et al. When Simple Is Near Optimal in Security Games. 2024. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2402.11209&authtype=sso&custid=ns315887.
APA
Jalota, D., Ostrovsky, M., & Pavone, M. (2024). When Simple is Near Optimal in Security Games.
Chicago
Jalota, Devansh, Michael Ostrovsky, and Marco Pavone. 2024. “When Simple Is Near Optimal in Security Games.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.2402.11209&authtype=sso&custid=ns315887.