1 citations · 1 across the 6 of their papers we have counts for
6 papers
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…
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…
A Nearly Optimal Deterministic Algorithm for Online Transportation Problem
Tsubasa Harada, Toshiya Itoh
For the online transportation problem with server sites, it has long been known that the competitive ratio of any deterministic algorithm is at least . Kalyanasundaram an…
A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
Tsubasa Harada
In the online facility assignment on a line (OFAL) with a set of servers and a capacity , each server with a capacity is placed on a line…
Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line
Tsubasa Harada, Toshiya Itoh
In the online facility assignment on a line with a set of servers and a capacity , each server with a capacity is placed…
Capacity-Insensitive Algorithms for Online Facility Assignment Problems on a Line
Tsubasa Harada, Toshiya Itoh, Shuichi Miyazaki
In the online facility assignment problem OFA(k,\ell), there exist k servers with a capacity \ell \geq 1 on a metric space and a request arrives one-by-one. The task of an online a…