Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Weakest-link attacker-defender games with multiple attack technologies

From MaRDI portal
Publication:3120573
Jump to:navigation, search

DOI10.1002/nav.21500zbMath1407.91071OpenAlexW2087890884MaRDI QIDQ3120573

Dan Kovenock, Brian Roberson, Daniel G. Arce

Publication date: 5 March 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://digitalcommons.chapman.edu/economics_articles/101


zbMATH Keywords

conflictColonel Blotto gameweakest linksuicide terrorism


Mathematics Subject Classification ID

Applications of game theory (91A80) Other game-theoretic models (91A40)


Related Items (7)

Network design and defence ⋮ Eternal peace in the tug-of-war? ⋮ Network disruption and the common-enemy effect ⋮ Intertemporal versus spatial externalities in counterterror policy games ⋮ Multimarket lobbying with reserves ⋮ Attacking and defending multiple valuable secrets in a big data world ⋮ How to preempt attacks in multi-front conflict with limited resources




This page was built for publication: Weakest-link attacker-defender games with multiple attack technologies

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3120573&oldid=16214557"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 21:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki