arXiv (All)
open access
Static and dynamic jamming games over wireless channels with mobile strategic players
We study a wireless jamming problem consisting of the competition between a legitimate receiver and a jammer, modeled as a zero-sum game where the value to maximize/minimize is the channel capacity at the receiver's side. Most approaches in the literature consider the two players to be stationary no
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
- Quantum channel discrimination against jammers#924461
- Quantum channel discrimination against jammers#920230
- A variable neighborhood search approach for cyclic bandwidth sum problem#243775
- Power Allocation Games on Signed Networks: Nash Equilibria and Coevolutionary Dynamics#612870
- Power Allocation Games on Signed Networks: Nash Equilibria and Coevolutionary Dynamics#611393
Record · ID 987354
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