A perpetual search for talents across overlapping generations: a learning process
From MaRDI portal
Publication:898767
DOI10.1016/j.mathsocsci.2015.05.002zbMath1331.91054OpenAlexW3124131901MaRDI QIDQ898767
Publication date: 18 December 2015
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2015.05.002
Applications of game theory (91A80) Markov and semi-Markov decision processes (90C40) Probabilistic games; gambling (91A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An asymptotically optimal policy for finite support models in the multiarmed bandit problem
- Learning about variable demand in the long run
- Online regret bounds for Markov decision processes with deterministic transitions
- Asymptotically efficient adaptive allocation rules
- Arm-acquiring bandits
- A short proof of the Gittins index theorem
- Multi-armed bandit problem revisited
- Optimal adaptive policies for sequential allocation problems
- On the optimality of the Gittins index rule for multi-armed bandits with multiple plays
- On Sequential Designs for Maximizing the Sum of $n$ Observations
- Multi-armed bandit problems with multiple plays and switching cost
- Comparative Testing of Experts
- Learning While Voting: Determinants of Collective Experimentation
- Extensions of the multiarmed bandit problem: The discounted case
- The Multi-Armed Bandit Problem: Decomposition and Computation
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
- Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost
- Optimal Search for the Best Alternative
- Funding Criteria for Research, Development, and Exploration Projects
- Optimality of index policies for stochastic scheduling with switching penalties
- Optimal Experimentation in a Changing Environment
- Switching Costs and the Gittins Index
- Optimal stochastic scheduling of forest networks with switching penalties
- Optimal Adaptive Policies for Markov Decision Processes
- The Nonstochastic Multiarmed Bandit Problem
- Multi-armed bandits with switching penalties
- Approximate Dynamic Programming
- Strategic Experimentation with Exponential Bandits
- Some aspects of the sequential design of experiments
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: A perpetual search for talents across overlapping generations: a learning process
