Zobrazeno 1 - 10
of 556
pro vyhledávání: '"Huang Zhiyi"'
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
Publikováno v:
Science and Engineering of Composite Materials, Vol 28, Iss 1, Pp 249-263 (2021)
This article discusses the influence of fiber types, including polyvinyl alcohol (PVA) fiber, polyethylene (PE) fiber, and steel fiber (SF), on the compressive strength, flexural strength, bending toughness, and tensile ductility of lightweight cemen
Externí odkaz:
https://doaj.org/article/5b5016ffcd87433fab52ee8abc73de42
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
We show that a simple greedy algorithm is $4.75$ probability-competitive for the Laminar Matroid Secretary Problem, improving the $3\sqrt{3} \approx 5.196$-competitive algorithm based on the forbidden sets technique (Soto, Turkieltaub, and Verdugo, 2
Externí odkaz:
http://arxiv.org/abs/2308.09880
We analyze union-find using potential functions motivated by continuous algorithms, and give alternate proofs of the $O(\log\log{n})$, $O(\log^{*}n)$, $O(\log^{**}n)$, and $O(\alpha(n))$ amortized cost upper bounds. The proof of the $O(\log\log{n})$
Externí odkaz:
http://arxiv.org/abs/2308.09021
Causal discovery with latent confounders is an important but challenging task in many scientific areas. Despite the success of some overcomplete independent component analysis (OICA) based methods in certain domains, they are computationally expensiv
Externí odkaz:
http://arxiv.org/abs/2305.19582