Jian Li

activity

20172022

most citedNearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection

17 citations · 52 across the 9 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2021

Multi-token Markov Game with Switching Costs

Jian Li, Daogao Liu

We study a general Markov game with metric switching costs: in each round, the player adaptively chooses one of several Markov chains to advance with the objective of minimizing th…

cs.DS2019★ 2 cited

Algorithms and Adaptivity Gaps for Stochastic $k$ -TSP

Haotian Jiang, Jian Li, Daogao Liu +1

Given a metric $(V, d)$ and a $root \in V$ , the classic $\textsf{$k$-TSP}$ problem is to find a tour originating at the $root$ of minimum length that visits at lea…

cs.DS2018

A PTAS for a Class of Stochastic Dynamic Programs

Hao Fu, Jian Li, Pan Xu

We develop a framework for obtaining polynomial time approximation schemes (PTAS) for a class of stochastic dynamic programs. Using our framework, we obtain the first PTAS for the…

Multi-token Markov Game with Switching Costs

Algorithms and Adaptivity Gaps for Stochastic k-TSP

A PTAS for a Class of Stochastic Dynamic Programs

Algorithms and Adaptivity Gaps for Stochastic $k$ -TSP