SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
On Sequential Designs for Maximizing the Sum of $n$ Observations
0 references·16 citing·30 second hop
On Sequential Designs for Maximizing the Sum of $n$ Observations (1956)On Sequential Designs for Maximizing the …An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits (2019)An asymptotically optimal heu…On Bayesian index policies for sequential resource allocation (2018)On Bayesian index policies fo…Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits (2015)Regret Analysis of the Finite…Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments (2013)Customer Acquisition via Disp…Computing a Classic Index for Finite-Horizon Bandits (2010)Computing a Classic Index for…Financial Liberalization, Financial Restraint, and Entrepreneurial Development (2009)Financial Liberalization, Fin…Learning to signal: Analysis of a micro-level reinforcement model (2008)Learning to signal: Analysis …Dynamic priority allocation via restless bandit marginal productivity indices (2007)Dynamic priority allocation v…A (2/3) n 3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain (2007)A (2/3) n 3 Fast-Pivoting Alg…ASYMPTOTIC BAYES ANALYSIS FOR THE FINITE-HORIZON ONE-ARMED-BANDIT PROBLEM (2003)ASYMPTOTIC BAYES ANALYSIS FOR…Randomized Allocation of Treatments in Sequential Experiments (1981)Randomized Allocation of Trea…Bernoulli One-Armed Bandits--Arbitrary Discount Sequences (1979)Bernoulli One-Armed Bandits--…The apparent conflict between estimation and control—a survey of the two-armed bandit problem (1976)The apparent conflict between…The two-armed-bandit problem with time-invariant finite memory (1970)The two-armed-bandit problem …Contributions to the "Two-Armed Bandit" Problem (1962)Contributions to the "Two-Arm…An Asymptotic Minimax Theorem for the Two Armed Bandit Problem (1960)An Asymptotic Minimax Theorem…Some aspects of the sequential design of experiments (1952)The multi-armed bandit problem with covariates (2013)An Information-Theoretic Approach to Minimax Regret in Partial Monitoring (2019)Bandit Processes and Dynamic Allocation Indices (1979)CHAPMAN AND HALL (1985)Restless bandits: activity allocation in a changing world (1988)Multi-Armed Bandit Allocation Indices. (1990)Asymptotically optimal priority policies for indexable and nonindexable restless bandits (2016)Dynamic Control of Birth-and-Death Restless Bandits: Application to Resource-Allocation Problems (2016)Learning Unknown Service Rates in Queues: A Multiarmed Bandit Approach (2020)Evolutionary stable strategies and game dynamics (1978)A dynamic model of social network formation (2000)The Stag Hunt and the Evolution of Social Structure (2003)Evolutionary dynamics of Lewis signaling games: signaling systems vs. partial pooling (2009)Inventing New Signals (2011)Evolutionary Game Theory: A Renaissance (2018)Finite-time Analysis of the Multiarmed Bandit Problem (2002)A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning (2010)Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting (2012)Multi-Armed Bandits: Theory and Applications to Online Learning in Networks (2019)An empirical evaluation of active inference in multi-armed bandits (2021)Multi-Armed Bandits and the Gittins Index (1980)Recent Developments in the Methods of Optimum and Related Experimental Designs (1988)A dynamic programming approach to the efficient design of clinical trials (2001)A Tutorial on Interactive Sensing in Social Networks (2014)Bandit problems and the exploration/exploitation tradeoff (1998)Optimal learning and experimentation in bandit problems (2002)A Structured Multiarmed Bandit Problem and the Greedy Policy (2009)A Unified Framework for Optimization Under Uncertainty (2016)A sequential transit network design algorithm with optimal learning under correlated beliefs (2024)
this work references cited by second hop

References

No references inside the corpus for this window.

Cited by

  • 2007Dynamic priority allocation via restless bandit marginal productivity indices136 cited
  • 1962Contributions to the "Two-Armed Bandit" Problem129 cited
  • 1960An Asymptotic Minimax Theorem for the Two Armed Bandit Problem124 cited
  • 2008Learning to signal: Analysis of a micro-level reinforcement model121 cited
  • 2018On Bayesian index policies for sequential resource allocation97 cited
  • 1970The two-armed-bandit problem with time-invariant finite memory89 cited
  • 2010Computing a Classic Index for Finite-Horizon Bandits82 cited
  • 1981Randomized Allocation of Treatments in Sequential Experiments71 cited
  • 2015Regret Analysis of the Finite-Horizon Gittins Index Strategy for Multi-Armed Bandits68 cited
  • 2003ASYMPTOTIC BAYES ANALYSIS FOR THE FINITE-HORIZON ONE-ARMED-BANDIT PROBLEM67 cited
  • 2013Customer Acquisition via Display Advertising Using Multi-Armed Bandit Experiments52 cited
  • 1976The apparent conflict between estimation and control—a survey of the two-armed bandit problem42 cited
  • 2019An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits41 cited
  • 2007A (2/3) n 3 Fast-Pivoting Algorithm for the Gittins Index and Optimal Stopping of a Markov Chain

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

40 cited
  • 1979Bernoulli One-Armed Bandits--Arbitrary Discount Sequences40 cited
  • 2009Financial Liberalization, Financial Restraint, and Entrepreneurial Development25 cited