8 citations · 19 across the 16 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.GT2021★ 1 cited
Online Max-min Fair Allocation
Yasushi Kawase, Hanna Sumita
We study an online version of the max-min fair allocation problem for indivisible items. In this problem, items arrive one by one, and each item must be allocated irrevocably on ar…
cs.GT2021
Fair and Truthful Mechanism with Limited Subsidy
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase +5
The notion of \emph{envy-freeness} is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guara…
stat.ML2021
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions
Kei Takemura, Shinji Ito, Daisuke Hatano +4
The contextual combinatorial semi-bandit problem with linear payoff functions is a decision-making problem in which a learner chooses a set of arms with the feature vectors in each…