Zobrazeno 1 - 10
of 724
pro vyhledávání: '"Huang, Zhiyi"'
The prophet secretary problem is a combination of the prophet inequality and the secretary problem, where elements are drawn from known independent distributions and arrive in uniformly random order. In this work, we design 1) a $0.688$-competitive a
Externí odkaz:
http://arxiv.org/abs/2411.01191
Small sample instance segmentation is a very challenging task, and many existing methods follow the training strategy of meta-learning which pre-train models on support set and fine-tune on query set. The pre-training phase, which is highly task rela
Externí odkaz:
http://arxiv.org/abs/2410.16063
Sampling without replacement is a natural online rounding strategy for converting fractional bipartite matching into an integral one. In Online Bipartite Matching, we can use the Balance algorithm to fractionally match each online vertex, and then sa
Externí odkaz:
http://arxiv.org/abs/2410.06868
Autor:
Dang, Trung, Huang, Zhiyi
We introduce a new model to study algorithm design under unreliable information, and apply this model for the problem of finding the uncorrupted maximum element of a list containing $n$ elements, among which are $k$ corrupted elements. Under our mode
Externí odkaz:
http://arxiv.org/abs/2409.06014
We study Stochastic Online Correlated Selection (SOCS), a family of online rounding algorithms for Non-IID Stochastic Online Submodular Welfare Maximization and special cases such as Online Stochastic Matching, Stochastic AdWords, and Stochastic Disp
Externí odkaz:
http://arxiv.org/abs/2408.12524
Matching, capturing allocation of items to unit-demand buyers, or tasks to workers, or pairs of collaborators, is a central problem in economics. Indeed, the growing prevalence of matching-based markets, many of which online in nature, has motivated
Externí odkaz:
http://arxiv.org/abs/2407.05381
We study multi-buyer multi-item sequential item pricing mechanisms for revenue maximization with the goal of approximating a natural fractional relaxation -- the ex ante optimal revenue. We assume that buyers' values are subadditive but make no assum
Externí odkaz:
http://arxiv.org/abs/2404.14679
This paper considers the hidden-action model of the principal-agent problem, in which a principal incentivizes an agent to work on a project using a contract. We investigate whether contracts with bounded payments are learnable and approximately opti
Externí odkaz:
http://arxiv.org/abs/2402.14486
Causal discovery with latent variables is a crucial but challenging task. Despite the emergence of numerous methods aimed at addressing this challenge, they are not fully identified to the structure that two observed variables are influenced by one l
Externí odkaz:
http://arxiv.org/abs/2312.11934
Mehta and Panigrahi (2012) proposed Online Matching with Stochastic Rewards, which generalizes the Online Bipartite Matching problem of Karp, Vazirani, and Vazirani (1990) by associating the edges with success probabilities. This new feature captures
Externí odkaz:
http://arxiv.org/abs/2309.10289