Hanna Sumita

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 52

Top Topics

Combinatorial Optimization

Top Venues

Publications

Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita
Fair division with two-sided preferences. Games Econ. Behav. 147 (2024)
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem. AAAI (2024)
Yasushi Kawase, Koichi Nishimura, Hanna Sumita
Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets. ICALP (2024)
Yasushi Kawase, Hanna Sumita
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation. Algorithmica 86 (2) (2024)
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations. AAAI (2024)
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo
A fair and truthful mechanism with limited subsidy. Games Econ. Behav. 144 (2024)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Bandit Task Assignment with Unknown Processing Time. NeurIPS (2023)
Koji Ichikawa, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
New classes of the greedy-applicable arm feature distributions in the sparse linear bandit problem. CoRR (2023)
Yasushi Kawase, Hanna Sumita, Yu Yokoi
Random Assignment of Indivisible Goods under Constraints. IJCAI (2023)
Yasushi Kawase, Koichi Nishimura, Hanna Sumita
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods. CoRR (2023)
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita
Fair Division with Two-Sided Preferences. IJCAI (2023)
Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. WSDM (2023)
Koichi Nishimura, Hanna Sumita
Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods. CoRR (2023)
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Makoto Yokoo
Towards Optimal Subsidy Bounds for Envy-freeable Allocations. CoRR (2023)
Yasushi Kawase, Hanna Sumita, Yu Yokoi
Random Assignment of Indivisible Goods under Constraints. CoRR (2022)
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Task Assignment Problems with Reusable Resources. AAAI (2022)
Yasushi Kawase, Atsushi Miyauchi, Hanna Sumita
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks. CoRR (2022)
Yasushi Kawase, Hanna Sumita
Online Max-min Fair Allocation. SAGT (2022)
Hiromichi Goko, Akitoshi Kawamura, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita
Online Scheduling on Identical Machines with a Metric State Space. STACS (2022)
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo
Fair and Truthful Mechanism with Limited Subsidy. AAMAS (2022)
Ayumi Igarashi, Yasushi Kawase, Warut Suksompong, Hanna Sumita
Fair Division with Two-Sided Preferences. CoRR (2022)
Hanna Sumita, Shinji Ito, Kei Takemura, Daisuke Hatano, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Task Assignment Problems with Reusable Resources. CoRR (2022)
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
Optimal Matroid Partitioning Problems. Algorithmica 83 (6) (2021)
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase, Kazuhisa Makino, Hanna Sumita, Akihisa Tamura, Yu Yokoi, Makoto Yokoo
Fair and Truthful Mechanism with Limited Subsidy. CoRR (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. CoRR (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits. AISTATS (2021)
Kei Takemura, Shinji Ito, Daisuke Hatano, Hanna Sumita, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions. AAAI (2021)
Yasushi Kawase, Hanna Sumita
Online Max-min Fair Allocation. CoRR (2021)
Yasushi Kawase, Hanna Sumita
On the Max-Min Fair Stochastic Allocation of Indivisible Goods. AAAI (2020)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Delay and Cooperation in Nonstochastic Linear Bandits. NeurIPS (2020)
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. PRICAI (1) (2019)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback. NeurIPS (2019)
Daisuke Hatano, Yuko Kuroki, Yasushi Kawase, Hanna Sumita, Naonori Kakimura, Ken-ichi Kawarabayashi
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising. CoRR (2019)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Total dual integrality of the linear complementarity problem. Ann. Oper. Res. 274 (1-2) (2019)
Yasushi Kawase, Hanna Sumita
Randomized Strategies for Robust Combinatorial Optimization. AAAI (2019)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Kei Takemura, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Improved Regret Bounds for Bandit Combinatorial Optimization. NeurIPS (2019)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular Maximization with Uncertain Knapsack Capacity. SIAM J. Discret. Math. 33 (3) (2019)
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
Causal Bandits with Propagating Inference. ICML (2018)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular Maximization with Uncertain Knapsack Capacity. LATIN (2018)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint. NeurIPS (2018)
Yasushi Kawase, Hanna Sumita, Takuro Fukunaga
Submodular maximization with uncertain knapsack capacity. CoRR (2018)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Online Regression with Partial Information: Generalization and Linear Projection. AISTATS (2018)
Yasushi Kawase, Hanna Sumita
Randomized Strategies for Robust Combinatorial Optimization. CoRR (2018)
Akihiro Yabe, Daisuke Hatano, Hanna Sumita, Shinji Ito, Naonori Kakimura, Takuro Fukunaga, Ken-ichi Kawarabayashi
Causal Bandits with Propagating Inference. CoRR (2018)
Shinji Ito, Daisuke Hatano, Hanna Sumita, Akihiro Yabe, Takuro Fukunaga, Naonori Kakimura, Ken-ichi Kawarabayashi
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation. NIPS (2017)
Hanna Sumita, Yasushi Kawase, Sumio Fujita, Takuro Fukunaga
Online Optimization of Video-Ad Allocation. IJCAI (2017)
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
Optimal Matroid Partitioning Problems. CoRR (2017)
Yasushi Kawase, Kei Kimura, Kazuhisa Makino, Hanna Sumita
Optimal Matroid Partitioning Problems. ISAAC (2017)
Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken-ichi Kawarabayashi
An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. IJCAI (2017)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Parameterized Complexity of Sparse Linear Complementarity Problems. Algorithmica 79 (1) (2017)
Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi
Optimal Pricing for Submodular Valuations with Bounded Curvature. AAAI (2017)
Takanori Maehara, Yasushi Kawase, Hanna Sumita, Katsuya Tono, Ken-ichi Kawarabayashi
Optimal Pricing for Submodular Valuations with Bounded Curvature. CoRR (2016)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Parameterized Complexity of Sparse Linear Complementarity Problems. IPEC (2015)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
The Linear Complementarity Problems with a Few Variables per Constraint. Math. Oper. Res. 40 (4) (2015)
Hanna Sumita, Naonori Kakimura, Kazuhisa Makino
Sparse Linear Complementarity Problems. CIAC (2013)