Algorithms for recursive delegation
From MaRDI portal
Publication:5145458
Recommendations
Cites work
- scientific article; zbMATH DE number 2147519 (Why is no real title available?)
- A Bilinear Programming Approach for Multiagent Planning
- A First Look at Rigorous Probability Theory
- Directed scale-free graphs
- Finite-time analysis of the multiarmed bandit problem
- Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
- On the Kullback-Leibler information divergence of locally stationary processes
- Optimal learning and experimentation in bandit problems.
- Optimality conditions for the simple convex bilevel programming problem in Banach spaces
- Probability Inequalities for Sums of Bounded Random Variables
- Probability Inequalities for the Sum of Independent Random Variables
- Quitting Games
- Quitting games -- an example
- Reinforcement learning and evolutionary algorithms for non-stationary multi-armed bandit problems
- Reinforcement learning. An introduction
- Robust Tests for the Equality of Variances
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
This page was built for publication: Algorithms for recursive delegation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145458)