Pith. sign in

REVIEW 1 cited by

Multi-player Bandits for Distributed Cognitive Radar

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.00274 v1 pith:MTTUDTTD submitted 2021-01-30 cs.IT math.IT

classification cs.ITmath.IT
keywords radarnodescommunicationsnetworksystemassumptionchannelcognitive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

With new applications for radar networks such as automotive control or indoor localization, the need for spectrum sharing and general interoperability is expected to rise. This paper describes the application of multi-player bandit algorithms for waveform selection to a distributed cognitive radar network that must coexist with a communications system. Specifically, we make the assumption that radar nodes in the network have no dedicated communication channel. As we will discuss later, nodes can communicate indirectly by taking actions which intentionally interfere with other nodes and observing the resulting collisions. The radar nodes attempt to optimize their own spectrum utilization while avoiding collisions, not only with each other, but with the communications system. The communications system is assumed to statically occupy some subset of the bands available to the radar network. First, we examine models that assume each node experiences equivalent channel conditions, and later examine a model that relaxes this assumption.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Coordinating the Unknown Lipschitz Constant in Multiplayer Bandits

    cs.LG 2026-08 conditional novelty 6.0 of 10

    Cooperative multiplayer Lipschitz bandits with an unknown Lipschitz constant achieve T^(Md+1)/(Md+2)-scale regret in three information structures, with dithering synchronizing the players' discretizations.

Pith tools