A perpetual search for talents across overlapping generations: a learning process

DOI10.1016/J.MATHSOCSCI.2015.05.002zbMATH Open1331.91054OpenAlexW3124131901MaRDI QIDQ898767FDOQ898767

Authors: Maxime Agbo 

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

Recommendations

• Multi-armed bandit processes with optimal selection of the operating times
• Generalized Bandit Problems
• Denumerable-Armed Bandits
• Multi-armed bandit problem revisited
• scientific article; zbMATH DE number 194374

Mathematics Subject Classification ID

Applications of game theory (91A80) Markov and semi-Markov decision processes (90C40) Probabilistic games; gambling (91A60)

Cites Work

• Asymptotically efficient adaptive allocation rules
• Arm-acquiring bandits
• Extensions of the multiarmed bandit problem: The discounted case
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Nonstochastic Multiarmed Bandit Problem
• Some aspects of the sequential design of experiments
• Finite-time analysis of the multiarmed bandit problem
• On Sequential Designs for Maximizing the Sum of $n$ Observations
• Funding Criteria for Research, Development, and Exploration Projects
• Strategic Experimentation with Exponential Bandits
• Optimal Experimentation in a Changing Environment
• Comparative Testing of Experts
• Approximate Dynamic Programming
• The sample complexity of exploration in the multi-armed bandit problem
• An asymptotically optimal policy for finite support models in the multiarmed bandit problem
• Optimal Adaptive Policies for Markov Decision Processes
• Optimal adaptive policies for sequential allocation problems
• The Multi-Armed Bandit Problem: Decomposition and Computation
• A short proof of the Gittins index theorem
• Multi-armed bandit problem revisited
• Title not available (Why is that?)
• Optimal stochastic scheduling of forest networks with switching penalties
• Optimal Search for the Best Alternative
• Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part II: Markovian rewards
• Learning while voting: determinants of collective experimentation
• Learning about variable demand in the long run
• On the optimality of the Gittins index rule for multi-armed bandits with multiple plays
• Multi-armed bandit problems with multiple plays and switching cost
• Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
• Asymptotically efficient adaptive allocation rules for the multiarmed bandit problem with switching cost
• Optimality of index policies for stochastic scheduling with switching penalties
• Switching Costs and the Gittins Index
• Multi-armed bandits with switching penalties
• Online regret bounds for Markov decision processes with deterministic transitions

This page was built for publication: A perpetual search for talents across overlapping generations: a learning process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898767)