8 citations · 9 across the 8 of their papers we have counts for
16 papers
Witness-Certified Fair Division with Comparison Queries
Tatsuhito Yamagata, Hanna Sumita
We study fair division of indivisible goods when agents' valuations are accessed only through ordinal comparisons between bundles, with arbitrary tie-breaking. In this model, even…
Decomposition Envy-Freeness in Random Assignment
Yasushi Kawase, Warut Suksompong, Hanna Sumita +1
In random assignment, fairness is often captured by stochastic-dominance envy-freeness (SD-EF). We observe that assignments satisfying SD-EF may admit decompositions that result in…
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…
Two-Sided Fairness in Many-to-One Matching
Ayumi Igarashi, Naoyuki Kamiyama, Yasushi Kawase +3
We consider a classic many-to-one matching setting, where participants need to be assigned to teams based on the preferences of both sides. Unlike most of the matching literature,…
Scheduling on Identical Machines with Setup Time and Unknown Execution Time
Yasushi Kawase, Kazuhisa Makino, Vinh Long Phan +1
In this study, we investigate a scheduling problem on identical machines in which jobs require initial setup before execution. We assume that an algorithm can dynamically form a ba…
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…