Algorithms for recursive delegation

DOI10.3233/AIC-190616zbMATH Open1464.68407OpenAlexW2968162136MaRDI QIDQ5145458FDOQ5145458

Authors: Juan Afanador, Nir Oren, M. 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

Recommendations

• Limit theorems for recursive delegation equilibria
• A logic of delegation
• Delegating learning
• Delegating decisions in strategic settings
• Task delegation in a peer-to-peer volunteer computing platform

zbMATH Keywords

trustdelegation

Mathematics Subject Classification ID

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

Cites Work

• Directed scale-free graphs
• Robust Tests for the Equality of Variances
• Probability Inequalities for Sums of Bounded Random Variables
• On the Kullback-Leibler information divergence of locally stationary processes
• Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
• Finite-time analysis of the multiarmed bandit problem
• Quitting games -- an example
• Probability Inequalities for the Sum of Independent Random Variables
• Quitting Games
• Title not available (Why is that?)
• A First Look at Rigorous Probability Theory
• Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
• Reinforcement learning and evolutionary algorithms for non-stationary multi-armed bandit problems
• Title not available (Why is that?)
• A Bilinear Programming Approach for Multiagent Planning
• Optimal learning and experimentation in bandit problems.
• Optimality conditions for the simple convex bilevel programming problem in Banach spaces

Cited In (1)

• Dynamic delegation with a persistent state

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)