arXiv:2607. 10571v1 Announce Type: cross Abstract: We study stochastic multi-armed bandits on dynamic graphs, where arms correspond to the vertices of a network with time-varying edges.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
arXiv:2602. 17315v3 Announce Type: replace-cross Abstract: We introduce Flickering Multi-Armed Bandits (FMAB) to model sequential decision-making in environments with changing action availability, where accessibility of the next action is restricted to a subset dependent on the agent's current choice.
arXiv:2409. 05980v2 Announce Type: replace-cross Abstract: Rested and Restless Bandits are two well-known bandit settings that are useful to model real-world sequential decision-making problems in which the expected reward of an arm evolves over time due to the actions we perform or due to the nature.
arXiv:2606. 08977v1 Announce Type: new Abstract: Motivated by the recency effect in online learning, we study algorithms for single-pass *sliding-window streaming multi-armed bandits (MABs)* in this paper.
arXiv:2606. 09002v1 Announce Type: cross Abstract: We study a stochastic multi-armed bandit problem in which the set of available arms expands over time.
The paper introduces Decision‑Relevant Fresh Comparison (DRFC), a method for decentralized bandit systems with heterogeneous agents whose local reward changes may not affect the global best action. DRFC gathers balanced samples from all agents and only switches the common best arm when fresh global evidence indicates a change, yielding a dynamic regret bound that does not depend on the number of local changes. An anytime‑valid sliding‑window extension further handles gradual drift, and experiments on synthetic, semi‑real, and MovieLens‑1M data demonstrate that DRFC ignores decision‑irrelevant local changes while the extension avoids false switches.
Decentralized bandit systems often contain heterogeneous agents: rewards can change at individual agents even when the best action for the network stays the same. These local changes may cancel when r...