1 citations · 1 across the 6 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
Tsubasa Harada, Yasushi Kawase, Hanna Sumita
We study the repeated optimal stopping problem, in which the same optimal stopping instance with an unknown distribution is solved repeatedly over rounds. We aim to simultaneou…
cs.LG2025
Bandit Max-Min Fair Allocation
Tsubasa Harada, Shinji Ito, Hanna Sumita
In this paper, we study a new decision-making problem called the bandit max-min fair allocation (BMMFA) problem. The goal of this problem is to maximize the minimum utility among a…