Sparse Linear Complementarity Problems. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (CIAC, 2013)

The Linear Complementarity Problems with a Few Variables per Constraint. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Math. Oper. Res., 2015)

Optimal Pricing for Submodular Valuations with Bounded Curvature. - Takanori Maehara; Yasushi Kawase; Hanna Sumita; Katsuya Tono; Ken-ichi Kawarabayashi (AAAI, 2017)

Online Optimization of Video-Ad Allocation. - Hanna Sumita; Yasushi Kawase; Sumio Fujita; Takuro Fukunaga (IJCAI, 2017)

An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. - Hanna Sumita; Yuma Yonebayashi; Naonori Kakimura; Ken-ichi Kawarabayashi (IJCAI, 2017)

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NIPS, 2017)

Parameterized Complexity of Sparse Linear Complementarity Problems. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Algorithmica, 2017)

Online Regression with Partial Information: Generalization and Linear Projection. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2018)

Causal Bandits with Propagating Inference. - Akihiro Yabe; Daisuke Hatano; Hanna Sumita; Shinji Ito; Naonori Kakimura; Takuro Fukunaga; Ken-ichi Kawarabayashi (ICML, 2018)

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Akihiro Yabe; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2018)

Randomized Strategies for Robust Combinatorial Optimization. - Yasushi Kawase; Hanna Sumita (AAAI, 2019)

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

Improved Regret Bounds for Bandit Combinatorial Optimization. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2019)

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. - Daisuke Hatano; Yuko Kuroki; Yasushi Kawase; Hanna Sumita; Naonori Kakimura; Ken-ichi Kawarabayashi (PRICAI (1), 2019)

Total dual integrality of the linear complementarity problem. - Hanna Sumita; Naonori Kakimura; Kazuhisa Makino (Ann. Oper. Res., 2019)

Submodular Maximization with Uncertain Knapsack Capacity. - Yasushi Kawase; Hanna Sumita; Takuro Fukunaga (SIAM J. Discret. Math., 2019)

On the Max-Min Fair Stochastic Allocation of Indivisible Goods. - Yasushi Kawase; Hanna Sumita (AAAI, 2020)

Delay and Cooperation in Nonstochastic Linear Bandits. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2020)

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2021)

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. - Kei Takemura; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AISTATS, 2021)

Optimal Matroid Partitioning Problems. - Yasushi Kawase; Kei Kimura; Kazuhisa Makino; Hanna Sumita (Algorithmica, 2021)

Online Task Assignment Problems with Reusable Resources. - Hanna Sumita; Shinji Ito; Kei Takemura; Daisuke Hatano; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2022)

Online Max-min Fair Allocation. - Yasushi Kawase; Hanna Sumita (SAGT, 2022)

Online Scheduling on Identical Machines with a Metric State Space. - Hiromichi Goko; Akitoshi Kawamura; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita (STACS, 2022)

Random Assignment of Indivisible Goods under Constraints. - Yasushi Kawase; Hanna Sumita; Yu Yokoi (IJCAI, 2023)

Bandit Task Assignment with Unknown Processing Time. - Shinji Ito; Daisuke Hatano; Hanna Sumita; Kei Takemura; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (NeurIPS, 2023)

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. - Yasushi Kawase; Atsushi Miyauchi 001; Hanna Sumita (WSDM, 2023)

Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods. - Koichi Nishimura; Hanna Sumita (CoRR, 2023)

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods. - Yasushi Kawase; Koichi Nishimura; Hanna Sumita (CoRR, 2023)

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. - Koji Ichikawa; Shinji Ito; Daisuke Hatano; Hanna Sumita; Takuro Fukunaga; Naonori Kakimura; Ken-ichi Kawarabayashi (AAAI, 2024)

Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. - Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Makoto Yokoo (AAAI, 2024)

Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. - Yasushi Kawase; Koichi Nishimura; Hanna Sumita (ICALP, 2024)

A fair and truthful mechanism with limited subsidy. - Hiromichi Goko; Ayumi Igarashi 001; Yasushi Kawase; Kazuhisa Makino; Hanna Sumita; Akihisa Tamura; Yu Yokoi; Makoto Yokoo (Games Econ. Behav., 2024)

Fair division with two-sided preferences. - Ayumi Igarashi 001; Yasushi Kawase; Warut Suksompong; Hanna Sumita (Games Econ. Behav., 2024)

Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. - Yasushi Kawase; Hanna Sumita (Algorithmica, 2024)

Scheduling on Identical Machines with Setup Time and Unknown Execution Time. - Yasushi Kawase; Kazuhisa Makino; Vinh Long Phan; Hanna Sumita (WADS, 2025)

A general framework for finding diverse solutions via network flow and its applications. - Yuni Iwamasa; Tomoki Matsuda; Shunya Morihira; Hanna Sumita (CoRR, 2025)

Bandit Max-Min Fair Allocation. - Tsubasa Harada; Shinji Ito; Hanna Sumita (CoRR, 2025)