Hanna Sumita

Algorithmica, February, 2024

Fair division with two-sided preferences.

[BibT_eX]

[DOI]

Games Econ. Behav., 2024

A fair and truthful mechanism with limited subsidy.

[BibT_eX]

[DOI]

Games Econ. Behav., 2024

Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets.

[BibT_eX]

[DOI]

Koichi Nishimura

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Towards Optimal Subsidy Bounds for Envy-Freeable Allocations.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods.

[BibT_eX]

[DOI]

Koichi Nishimura

CoRR, 2023

Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods.

[BibT_eX]

[DOI]

Koichi Nishimura

CoRR, 2023

Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks.

[BibT_eX]

[DOI]

Atsushi Miyauchi

Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023

Bandit Task Assignment with Unknown Processing Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Random Assignment of Indivisible Goods under Constraints.

[BibT_eX]

[DOI]

Yu Yokoi

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Online Scheduling on Identical Machines with a Metric State Space.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

Online Max-min Fair Allocation.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022

Online Task Assignment Problems with Reusable Resources.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Optimal Matroid Partitioning Problems.

[BibT_eX]

[DOI]

Algorithmica, 2021

A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Delay and Cooperation in Nonstochastic Linear Bandits.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

On the Max-Min Fair Stochastic Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Submodular Maximization with Uncertain Knapsack Capacity.

[BibT_eX]

[DOI]

Takuro Fukunaga

SIAM J. Discret. Math., 2019

Total dual integrality of the linear complementarity problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2019

Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising.

[BibT_eX]

[DOI]

Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019

Improved Regret Bounds for Bandit Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Randomized Strategies for Robust Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Regret Bounds for Online Portfolio Selection with a Cardinality Constraint.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Causal Bandits with Propagating Inference.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Machine Learning, 2018

Online Regression with Partial Information: Generalization and Linear Projection.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018

2017

Parameterized Complexity of Sparse Linear Complementarity Problems.

[BibT_eX]

[DOI]

Algorithmica, 2017

Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization.

[BibT_eX]

[DOI]

Yuma Yonebayashi

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Online Optimization of Video-Ad Allocation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Optimal Pricing for Submodular Valuations with Bounded Curvature.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2015

The Linear Complementarity Problems with a Few Variables per Constraint.

[BibT_eX]

[DOI]

Math. Oper. Res., 2015

2013

Sparse Linear Complementarity Problems.

[BibT_eX]

[DOI]