arXiv (All)
open access
Online Learning in Stackelberg Security Games with Time-Varying Attack Intensities
This work investigates no-regret online learning for Repeated Stackelberg Security Games (RSSGs) against attackers with time-varying attack intensities. Standard RSSG models often assume fixed attack intensities, limiting their ability to capture evolving attack capabilities. To bridge this gap, we
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- No-Regret Learning in Stackelberg Security Games with an Unknown, Bounded Set of Attacker Types#1355003
- An Epistemic Analysis of Random Coordinated Attack#282763
- Sparse One-Step-Ahead Optimal Control of Time-Varying Affine Opinion Networks: Tracking and Competitive Games#1034267
- Adaptive inference for functionals of M-estimands#1144241
- Pay to Learn, Share to Earn: Incentivized Federated Multi-Player Bandits#1202481
Record · ID 1199929
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive