Pith. sign in

The Assistive Multi-Armed Bandit

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Learning preferences implicit in the choices humans make is a well studied problem in both economics and computer science. However, most work makes the assumption that humans are acting (noisily) optimally with respect to their preferences. Such approaches can fail when people are themselves learning about what they want. In this work, we introduce the assistive multi-armed bandit, where a robot assists a human playing a bandit task to maximize cumulative reward. In this problem, the human does not know the reward function but can learn it through the rewards received from arm pulls; the robot only observes which arms the human pulls but not the reward associated with each pull. We offer sufficient and necessary conditions for successfully assisting the human in this framework. Surprisingly, better human performance in isolation does not necessarily lead to better performance when assisted by the robot: a human policy can do better by effectively communicating its observed rewards to the robot. We conduct proof-of-concept experiments that support these results. We see this work as contributing towards a theory behind algorithms for human-robot interaction.

fields

cs.AI 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Strategic Decision Support for AI Agents

cs.AI · 2026-06-10 · unverdicted · novelty 5.0

The paper introduces an optimization framework for AI agents to strategically seek support, proving a threshold policy on support value and providing an online algorithm to control missed-support error without distributional assumptions.

citing papers explorer

Showing 1 of 1 citing paper.

  • Strategic Decision Support for AI Agents cs.AI · 2026-06-10 · unverdicted · none · ref 11 · internal anchor

    The paper introduces an optimization framework for AI agents to strategically seek support, proving a threshold policy on support value and providing an online algorithm to control missed-support error without distributional assumptions.