Algorithms for recursive delegation

DOI10.3233/AIC-190616zbMath1464.68407OpenAlexW2968162136MaRDI QIDQ5145458

Nir Oren, Juan Afanador, Murilo S. Baptista

Publication date: 20 January 2021

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-190616

zbMATH Keywords

trustdelegation

Mathematics Subject Classification ID

Applications of game theory (91A80) Probabilistic games; gambling (91A60) Agent technology and artificial intelligence (68T42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quitting games -- an example
• Optimal learning and experimentation in bandit problems.
• On the Kullback-Leibler information divergence of locally stationary processes
• Reinforcement learning and evolutionary algorithms for non-stationary multi-armed bandit problems
• Multi‐Armed Bandit Allocation Indices
• Probability Inequalities for the Sum of Independent Random Variables
• A First Look at Rigorous Probability Theory
• A Bilinear Programming Approach for Multiagent Planning
• Robust Tests for the Equality of Variances
• Optimality conditions for the simple convex bilevel programming problem in Banach spaces
• Probability Inequalities for Sums of Bounded Random Variables
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
• Quitting Games
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Algorithms for recursive delegation