Metraipolis › archive › dc_d76b60ae6b18
Networked Multi-Resource Defense Capabilities in a General Lotto Game — arXiv:2608.28732
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.28732
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T08:19:22.613Z
- SHA-256 of the archived text
668220a3ed932bbd5a95296e5445d8c9533d4ca8870207342b3b576a58df5466- Stable URL of this page
https://metraipolis.com/documento/dc_d76b60ae6b18
How to cite
Networked Multi-Resource Defense Capabilities in a General Lotto Game — arXiv:2608.28732 — arXiv (en), https://arxiv.org/abs/2608.28732 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d76b60ae6b18 (Metraipolis archive dc_d76b60ae6b18, sha256 668220a3ed932bbd5a95296e5445d8c9533d4ca8870207342b3b576a58df5466)
BibTeX
@misc{dcd76b60ae6b18,
title = {Networked Multi-Resource Defense Capabilities in a General Lotto Game — arXiv:2608.28732},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.28732},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d76b60ae6b18; sha256 668220a3ed932bbd5a95296e5445d8c9533d4ca8870207342b3b576a58df5466},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.28732. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Ensuring the security of complex systems involves the strategic allocation of defensive resources to prevent various types of attacks from succeeding. A defender often has multiple types of defensive assets at its disposal, where it must decide how to optimally deploy their heterogeneous capabilities across different attack types. In this paper, we formulate a multi-resource allocation problem in the form of a General Lotto game where a defender possesses various types of resources. A feature that we introduce is that their individual effectiveness against different types of attacks is characterized by a network weight matrix. In our analysis, we derive upper and lower bounds on the performance of the defender, and provide numerical evidence suggesting that they are tight. For the case of two attack types, we analytically prove that the bounds coincide, establishing an exact equilibrium characterization. We then numerically compare our proposed networked multi-resource architecture to an independent-defense benchmark from the existing literature. These results highlight fundamental and tractable structures underlying multi-attack-type defense problems. Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-01 in cs.GT). Categorie arXiv: Computer Science and Game Theory (cs.GT) ; Cryptography and Security (cs.CR); Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.28732 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T08:08:10.901Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).