Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Cai Linda"'
Cryptographic Self-Selection is a common primitive underlying leader-selection for Proof-of-Stake blockchain protocols. The concept was first popularized in Algorand [CM19], who also observed that the protocol might be manipulable. [FHWY22] provide a
Externí odkaz:
http://arxiv.org/abs/2407.16949
We consider a principal seller with $m$ heterogeneous products to sell to an additive buyer over independent items. The principal can offer an arbitrary menu of product bundles, but faces competition from smaller and more agile single-item sellers. T
Externí odkaz:
http://arxiv.org/abs/2406.13835
Sampling algorithms play an important role in controlling the quality and runtime of diffusion model inference. In recent years, a number of works~\cite{chen2023sampling,chen2023ode,benton2023error,lee2022convergence} have proposed schemes for diffus
Externí odkaz:
http://arxiv.org/abs/2406.00924
Despite having the same basic prophet inequality setup and model of loss aversion, conclusions in our multi-dimensional model differs considerably from the one-dimensional model of Kleinberg et al. For example, Kleinberg et al. gives a tight closed-f
Externí odkaz:
http://arxiv.org/abs/2309.14555
Autor:
Beyhaghi, Hedyeh, Cai, Linda
In 1979, Weitzman introduced Pandora's box problem as a framework for sequential search with costly inspections. Recently, there has been a surge of interest in Pandora's box problem, particularly among researchers working at the intersection of econ
Externí odkaz:
http://arxiv.org/abs/2308.12242
We consider the problem of repeatedly auctioning a single item to multiple i.i.d buyers who each use a no-regret learning algorithm to bid over time. In particular, we study the seller's optimal revenue, if they know that the buyers are no-regret lea
Externí odkaz:
http://arxiv.org/abs/2307.04175
Autor:
Jeon, Beomyeol, Cai, Linda, Shetty, Chirag, Srivastava, Pallavi, Jiang, Jintao, Ke, Xiaolan, Meng, Yitao, Xie, Cong, Gupta, Indranil
Machine Learning graphs (or models) can be challenging or impossible to train when either devices have limited memory, or models are large. To split the model across devices, learning-based approaches are still popular. While these result in model pl
Externí odkaz:
http://arxiv.org/abs/2301.08695
Autor:
Beyhaghi, Hedyeh, Cai, Linda
Weitzman introduced Pandora's box problem as a mathematical model of sequential search with inspection costs, in which a searcher is allowed to select a prize from one of $n$ alternatives. Several decades later, Doval introduced a close version of th
Externí odkaz:
http://arxiv.org/abs/2212.01524
Autor:
Cai, Linda, Saxena, Raghuvansh R.
The enhanced competition paradigm is an attempt at bridging the gap between simple and optimal auctions. In this line of work, given an auction setting with $m$ items and $n$ bidders, the goal is to find the smallest $n' \geq n$ such that selling the
Externí odkaz:
http://arxiv.org/abs/2105.08292
Autor:
Cai, Linda, Thomas, Clayton
The seminal book of Gusfield and Irving [GI89] provides a compact and algorithmically useful way to represent the collection of stable matches corresponding to a given set of preferences. In this paper, we reinterpret the main results of [GI89], givi
Externí odkaz:
http://arxiv.org/abs/1910.04401