8 citations · 19 across the 11 of their papers we have counts for
14 papers
Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
Eniko Kevi, Nguyen Kim Thang
Matching problems have been widely studied in the research community, especially Ad-Auctions with many applications ranging from network design to advertising. Following the variou…
Online Covering with Multiple Experts
Enikő Kevi, Kim-Thang Nguyen
Designing online algorithms with machine learning predictions is a recent technique beyond the worst-case paradigm for various practically relevant online problems (scheduling, cac…
One Gradient Frank-Wolfe for Decentralized Online Convex and Submodular Optimization
Tuan-Anh Nguyen, Nguyen Kim Thang, Denis Trystram
Decentralized learning has been studied intensively in recent years motivated by its wide applications in the context of federated learning. The majority of previous research focus…
Competitive Algorithms for Online Weighted Bipartite Matching and its Variants
Nguyen Kim Thang
Online bipartite matching has been extensively studied. In the unweighted setting, Karp et al. gave an optimal -competitive randomized algorithm. In the weighted setting…
Online learning for min-max discrete problems
Evripidis Bampis, Dimitris Christou, Bruno Escoffier +1
We study various discrete nonlinear combinatorial optimization problems in an online learning framework. In the first part, we address the question of whether there are negative re…
Game Efficiency through Linear Programming Duality
Nguyen Kim Thang
The efficiency of a game is typically quantified by the price of anarchy (PoA), defined as the worst ratio of the objective function value of an equilibrium --- solution of the gam…