A perpetual search for talents across overlapping generations: a learning process
type: Item
instance of: scholarly article
title: A perpetual search for talents across overlapping generations: a learning process
zbMATH Open document ID: 1331.91054
author: Maxime Agbo
published in: Mathematical Social Sciences
publication date: 2015-12-18T00:00:00Z
Mathematics Subject Classification ID: 91A60
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 6522447
MaRDI profile type: Publication
full work available at URL: j.mathsocsci.2015.05.002
OpenAlex ID: W3124131901
cites work: Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost
cites work: Multi-armed bandit problems with multiple plays and switching cost
cites work: Comparative Testing of Experts
cites work: Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
cites work: Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
cites work: Multi-armed bandits with switching penalties
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Switching Costs and the Gittins Index
cites work: On Sequential Designs for Maximizing the Sum of $n$ Observations
cites work: Optimal adaptive policies for sequential allocation problems
cites work: Optimal Adaptive Policies for Markov Decision Processes
cites work: Q4057976
cites work: An asymptotically optimal policy for finite support models in the multiarmed bandit problem
cites work: Multi-armed bandit problem revisited
cites work: The Multi-Armed Bandit Problem: Decomposition and Computation
cites work: Optimal Experimentation in a Changing Environment
cites work: Strategic Experimentation with Exponential Bandits
cites work: Asymptotically efficient adaptive allocation rules
cites work: Q3093197
cites work: Online regret bounds for Markov decision processes with deterministic transitions
cites work: On the optimality of the Gittins index rule for multi-armed bandits with multiple plays
cites work: Approximate Dynamic Programming
cites work: Some aspects of the sequential design of experiments
cites work: Funding Criteria for Research, Development, and Exploration Projects
cites work: Learning about variable demand in the long run
cites work: Learning While Voting: Determinants of Collective Experimentation
cites work: A short proof of the Gittins index theorem
cites work: Optimality of index policies for stochastic scheduling with switching penalties
cites work: Optimal stochastic scheduling of forest networks with switching penalties
cites work: Extensions of the multiarmed bandit problem: The discounted case
cites work: Optimal Search for the Best Alternative
cites work: Q3882215
cites work: Arm-acquiring bandits
cites work: Q3815845
DOI: 10.1016/J.MATHSOCSCI.2015.05.002
description: scientific article; zbMATH DE number 6522447