2025
Bandit Max-Min Fair Allocation.
CoRR, May, 2025
A general framework for finding diverse solutions via network flow and its applications.
CoRR, April, 2025
2024
Randomized Strategies for Robust Combinatorial Optimization with Approximate Separation.
Algorithmica, February, 2024
Fair division with two-sided preferences.
Games Econ. Behav., 2024
A fair and truthful mechanism with limited subsidy.
Games Econ. Behav., 2024
Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Towards Optimal Subsidy Bounds for Envy-Freeable Allocations.
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.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods.
CoRR, 2023
Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods.
CoRR, 2023
Stochastic Solutions for Dense Subgraph Discovery in Multilayer Networks.
Proceedings of the Sixteenth ACM International Conference on Web Search and Data Mining, 2023
Bandit Task Assignment with Unknown Processing Time.
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.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023
2022
Online Scheduling on Identical Machines with a Metric State Space.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022
Online Max-min Fair Allocation.
Proceedings of the Algorithmic Game Theory - 15th International Symposium, 2022
Online Task Assignment Problems with Reusable Resources.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022
2021
Optimal Matroid Partitioning Problems.
Algorithmica, 2021
A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits.
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.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
2020
Delay and Cooperation in Nonstochastic Linear Bandits.
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.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
2019
Submodular Maximization with Uncertain Knapsack Capacity.
SIAM J. Discret. Math., 2019
Total dual integrality of the linear complementarity problem.
Ann. Oper. Res., 2019
Non-zero-sum Stackelberg Budget Allocation Game for Computational Advertising.
Proceedings of the PRICAI 2019: Trends in Artificial Intelligence, 2019
Improved Regret Bounds for Bandit Combinatorial Optimization.
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.
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.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019
2018
Regret Bounds for Online Portfolio Selection with a Cardinality Constraint.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Causal Bandits with Propagating Inference.
Proceedings of the 35th International Conference on Machine Learning, 2018
Online Regression with Partial Information: Generalization and Linear Projection.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2018
2017
Parameterized Complexity of Sparse Linear Complementarity Problems.
Algorithmica, 2017
Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation.
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.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
Online Optimization of Video-Ad Allocation.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
Optimal Pricing for Submodular Valuations with Bounded Curvature.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017
2015
The Linear Complementarity Problems with a Few Variables per Constraint.
Math. Oper. Res., 2015
2013
Sparse Linear Complementarity Problems.
Proceedings of the Algorithms and Complexity, 8th International Conference, 2013