Atsuyoshi Nakamura

Ranking Bandits for Carousel Interfaces with Observable Browsing Depth

Carousel interfaces allow a recommender system to directly observe how far a user has browsed. This signal distinguishes displayed but unclicked items from items that were never displayed, whereas conventional ranking-bandit models, including cascade and position-based models, generally treat examination as latent. We...

Selecting k Paths with the Minimum Longest Path Length in the Stochastic Semi-Bandit Setting

This study addresses an online problem in which paths from an origin vertex to a destination vertex must be selected at each time step within a network represented as a directed graph, and formulate the semi-bandit problem of selecting a set of paths to minimize the maximum traversal time among the selected paths.

Monotone Bandits: Power of Maximum Likelihood Estimation in Online Decision-Making