Results 91 to 100 of about 18,568,643 (214)
LEO satellite constellations: a two-stage beamforming scheme based on CMAB
For the beamforming design problem of frequency-division duplex (FDD) massive multiple-input multiple-output (MIMO) low earth orbit (LEO) satellite constellations, a two-stage beamforming (TSB) scheme based on combinatorial multi-armed bandit (CMAB) was
SONG Xinting +4 more
doaj +2 more sources
MAB-RSP: Data pricing based on Stackelberg game in MCS
With the proliferation of mobile smart devices and wireless communication technologies, Mobile CrowdSensing (MCS) has emerged as a significant data collection method.
Yongjiao Sun, Xueyan Ma, Anrui Han
doaj +1 more source
Determination of the Minimax Risk for the Normal Two-Armed Bandit
Abstract According to the main theorem of the theory of games minimax strategy and risk for the two-armed bandit problem are determined as Bayes ones corresponding to the worst prior distribution. Incomes are assumed to be normally distributed with unit variances and expectations depending on picked alternatives only.
openaire +2 more sources
A Confirmation of a Conjecture on the Feldman's Two-armed Bandit Problem [PDF]
Myopic strategy is one of the most important strategies when studying bandit problems. In this paper, we consider the two-armed bandit problem proposed by Feldman.
Lin, Yiwei +2 more
core
How well a stimulus predicts reward is correlated with the amount of attention that stimulus receives. However, the relationship between a cue’s predictiveness and the amount of attention it draws is not yet fully understood.
Nidhila Masha +4 more
doaj
A Conjecture of Berry Regarding A Bernoulli Two-Armed Bandit
Two independent Bernoulli processes (arms) have unknown success probabilities $\rho$ and $\lambda$. The initial (a priori) information about $\rho$ and $\lambda$ is expressed by probability distributions $dR(\rho) = C_R \rho{^r_0}(1 - \rho)^{r_0'} d\mu(\rho) \text{for the right arm},$ and $dL(\lambda) = C_L \lambda^{l_0}(1 - \lambda)^{l_0'} d\mu ...
openaire +3 more sources
A note on the two-armed bandit problem with finite memory
Robbins has proposed a finite memory constraint on the two-armed bandit problem in which the coin to be tossed at each stage may depend on the history of the previous tosses only through the outcomes of the last r tosses. Letting the choice of coin depend on the time at which the toss is made, we exhibit a deterministic rule with memory r = 2, the ...
openaire +2 more sources
Optimizing the ε Parameter in ε-Greedy Strategy for Multi-Armed Bandits [PDF]
With the widespread adoption of the internet, online advertising has grown exponentially. To enhance ad recommendation efficiency, various Multi-Armed Bandit (MAB) algorithms have been deployed. Among these, the Thompson ε-Greedy algorithm integrates the
Jiang Haotong
doaj +1 more source
Optimal Job Design and Career Dynamics in the Presence of Uncertainty [PDF]
The paper studies a learning model in which information about a worker's ability can be acquired symmetrically by the worker and a firm in any period by observing the worker's performance on a given task.
Elena Pastorino
core
Efficient Online Marketing Optimization Based on Hierarchical Unimodal Bandit Algorithm
The application of online learning approaches is now widely employed in numerous e-commerce settings, including A/B testing for customer orientation and coupon distribution strategies.
Tianchi Zhao, Ziyi Zong, Pu Zhang
doaj +1 more source

