Results 41 to 50 of about 147 (138)
Aversion to Option Loss in a Restless Bandit Task
Computational Brain & Behavior, 2018 In everyday life people need to make choices without full information about the environment, which poses an explore-exploit dilemma in which one needs to balance the need to learn about the world and the need to obtain rewards from it. The explore-exploit dilemma is often studied using the multi-armed restless bandit task, in which people repeatedly ...
Navarro, DJ, Tran, P, Baz, N
openaire +3 more sources
Between theft and treason: latrocinium in Carolingian capitularies
Early Medieval Europe, Volume 33, Issue 3, Page 367-390, August 2025.Suppressing robbery, latrocinium, was a priority for Charlemagne, Louis the Pious, Charles the Bald, and Louis II at key political moments. Latrones were conceptualized as ordinary thieves, as highway robbers, and as threats to peace and security. In capitularies, latrocinium was implicitly and explicitly associated with infidelity.
James R. Burns
wiley +1 more source
A Novel Scheduling Index Rule Proposal for QoE Maximization in Wireless Networks
Abstract and Applied Analysis, Volume 2014, Issue 1, 2014., 2014 This paper deals with the resource allocation problem aimed at maximizing users’ perception of quality in wireless channels with time‐varying capacity. First of all, we model the subjective quality‐aware scheduling problem in the framework of Markovian decision processes.
Ianire Taboada +2 more
wiley +1 more source
Introduction to the special issue on Innovative Applications of Artificial Intelligence (IAAI 2024)
AI Magazine, Volume 45, Issue 4, Page 440-442, Winter 2024.Abstract This special issue of AI Magazine covers select applications from the Innovative Applications of Artificial Intelligence (IAAI) conference held in 2024 in Vancouver, Canada. The articles address a broad range of very challenging issues and contain great lessons for AI researchers and application developers.
Alexander Wong, Yuhao Chen, Jan Seyler
wiley +1 more source
AI Magazine, Volume 45, Issue 4, Page 526-536, Winter 2024.Abstract Harnessing the wide‐spread availability of cell phones, many nonprofits have launched mobile health (mHealth) programs to deliver information via voice or text to beneficiaries in underserved communities, with maternal and infant health being a key area of such mHealth programs.
Shresth Verma +8 more
wiley +1 more source
Thompson Sampling in Non-Episodic Restless Bandits
CoRR, 2019 Restless bandit problems assume time-varying reward distributions of the arms, which adds flexibility to the model but makes the analysis more challenging. We study learning algorithms over the unknown reward distributions and prove a sub-linear, $O(\sqrt{T}\log T)$, regret bound for a variant of Thompson sampling.
Young Hun Jung +2 more
openaire +2 more sources
The role of rumors in the emergence and diffusion of pogroms
Conflict Resolution Quarterly, Volume 41, Issue 3, Page 235-252, Spring 2024.Abstract In studies on single pogroms, but especially in analyses of waves of pogroms, the central role of rumor communication in the run‐up to, but also in the spread of pogroms has been emphasized time and again. In the following, the functions and types of rumor communication will be examined in more detail in order to understand their role in the ...
Werner Bergmann
wiley +1 more source
On the Whittle Index for Restless Multiarmed Hidden Markov Bandits [PDF]
IEEE Transactions on Automatic Control, 2018 We consider a restless multi-armed bandit in which each arm can be in one of two states. When an arm is sampled, the state of the arm is not available to the sampler. Instead, a binary signal with a known randomness that depends on the state of the arm is available. No signal is available if the arm is not sampled.
Rahul Meshram +2 more
openaire +5 more sources
CoRRA more general formulation of the linear bandit problem is considered to allow for dependencies over time. Specifically, it is assumed that there exists an unknown $\mathbb{R}^d$-valued stationary $φ$-mixing sequence of parameters $(θ_t,~t \in \mathbb{N})$ which gives rise to pay-offs.
openaire +2 more sources
Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories [PDF]
Operations Research, 2014 In this paper we introduce the knapsack problem for perishable inventories concerning the optimal dynamic allocation of a collection of products to a limited knapsack. The motivation for designing such a problem comes from retail revenue management, where different products often have an associated lifetime during which they can only be sold, and the ...
Darina Graczová, Peter Jacko
openaire +4 more sources