Author of the publication

The Linear Complementarity Problems with a Few Variables per Constraint.

, , and . Math. Oper. Res., 40 (4): 1015-1026 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Parameterized Complexity of Sparse Linear Complementarity Problems., , and . IPEC, volume 43 of LIPIcs, page 355-364. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Online Regression with Partial Information: Generalization and Linear Projection., , , , , , and . AISTATS, volume 84 of Proceedings of Machine Learning Research, page 1599-1607. PMLR, (2018)Submodular Maximization with Uncertain Knapsack Capacity., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 653-668. Springer, (2018)Online Max-min Fair Allocation., and . SAGT, volume 13584 of Lecture Notes in Computer Science, page 526-543. Springer, (2022)Towards Optimal Subsidy Bounds for Envy-Freeable Allocations., , , , and . AAAI, page 9824-9831. AAAI Press, (2024)New Classes of the Greedy-Applicable Arm Feature Distributions in the Sparse Linear Bandit Problem., , , , , , and . AAAI, page 12708-12716. AAAI Press, (2024)Random Assignment of Indivisible Goods under Constraints., , and . IJCAI, page 2792-2799. ijcai.org, (2023)A Parameter-Free Algorithm for Misspecified Linear Contextual Bandits., , , , , , and . AISTATS, volume 130 of Proceedings of Machine Learning Research, page 3367-3375. PMLR, (2021)Regret Bounds for Online Portfolio Selection with a Cardinality Constraint., , , , , , and . NeurIPS, page 10611-10620. (2018)Optimal Matroid Partitioning Problems., , , and . ISAAC, volume 92 of LIPIcs, page 51:1-51:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)