| Causal bandits with propagating inference A Yabe, D Hatano, H Sumita, S Ito, N Kakimura, T Fukunaga, ... International Conference on Machine Learning, 5512-5520, 2018 | 32 | 2018 |
| Delay and cooperation in nonstochastic linear bandits S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ... Advances in Neural Information Processing Systems 33, 4872-4883, 2020 | 25 | 2020 |
| A parameter-free algorithm for misspecified linear contextual bandits K Takemura, S Ito, D Hatano, H Sumita, T Fukunaga, N Kakimura, ... International Conference on Artificial Intelligence and Statistics, 3367-3375, 2021 | 15 | 2021 |
| A fair and truthful mechanism with limited subsidy H Goko, A Igarashi, Y Kawase, K Makino, H Sumita, A Tamura, Y Yokoi, ... Games and Economic Behavior 144, 49-70, 2024 | 14 | 2024 |
| Online Optimization of Video-Ad Allocation. H Sumita, Y Kawase, S Fujita, T Fukunaga, RA Center IJCAI, 423-429, 2017 | 14 | 2017 |
| Online max-min fair allocation Y Kawase, H Sumita International Symposium on Algorithmic Game Theory, 526-543, 2022 | 11 | 2022 |
| On the max-min fair stochastic allocation of indivisible goods Y Kawase, H Sumita Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 2070-2078, 2020 | 10 | 2020 |
| Randomized strategies for robust combinatorial optimization Y Kawase, H Sumita Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7876-7883, 2019 | 10 | 2019 |
| Oracle-efficient algorithms for online linear optimization with bandit feedback S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ... Advances in Neural Information Processing Systems 32, 2019 | 10 | 2019 |
| Improved regret bounds for bandit combinatorial optimization S Ito, D Hatano, H Sumita, K Takemura, T Fukunaga, N Kakimura, ... Advances in Neural Information Processing Systems 32, 2019 | 9 | 2019 |
| Submodular maximization with uncertain knapsack capacity Y Kawase, H Sumita, T Fukunaga SIAM Journal on Discrete Mathematics 33 (3), 1121-1145, 2019 | 9 | 2019 |
| Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods K Nishimura, H Sumita arXiv preprint arXiv:2302.13342, 2023 | 8 | 2023 |
| Fair division with two-sided preferences A Igarashi, Y Kawase, W Suksompong, H Sumita arXiv preprint arXiv:2206.05879, 2022 | 8 | 2022 |
| Regret bounds for online portfolio selection with a cardinality constraint S Ito, D Hatano, H Sumita, A Yabe, T Fukunaga, N Kakimura, ... Advances in Neural Information Processing Systems 31, 2018 | 8 | 2018 |
| An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization. H Sumita, Y Yonebayashi, N Kakimura, K Kawarabayashi IJCAI 2017, 4412-4418, 2017 | 8 | 2017 |
| Online task assignment problems with reusable resources H Sumita, S Ito, K Takemura, D Hatano, T Fukunaga, N Kakimura, ... Proceedings of the AAAI Conference on Artificial Intelligence 36 (5), 5199-5207, 2022 | 7 | 2022 |
| Optimal pricing for submodular valuations with bounded curvature T Maehara, Y Kawase, H Sumita, K Tono, K Kawarabayashi Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017 | 7 | 2017 |
| Fair allocation with binary valuations for mixed divisible and indivisible goods Y Kawase, K Nishimura, H Sumita arXiv preprint arXiv:2306.05986, 2023 | 6 | 2023 |
| Stochastic solutions for dense subgraph discovery in multilayer networks Y Kawase, A Miyauchi, H Sumita Proceedings of the Sixteenth ACM International Conference on Web Search and …, 2023 | 6 | 2023 |
| Optimal matroid partitioning problems Y Kawase, K Kimura, K Makino, H Sumita Algorithmica 83, 1653-1676, 2021 | 6* | 2021 |
