Timely Persuasion with Opposing Senders: When Does Competition Help the Receiver?
cs.IT, cs.GT, cs.NI, cs.SY, eess.SP, eess.SY, math.IT
Submitted: 2026-10-03
Updated: 2026-10-03
Related papers
- Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
- Discrepancy for Random Linear Codes
- A New Approach to Code Smoothing Bounds
- Contextual Memory-Enhanced Source Coding for Low-SNR Communications
- Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels
- Anonymous Shamir's Secret Sharing via Reed-Solomon Codes Against Permutations, Insertions, and Deletions