34 citations · 45 across the 11 of their papers we have counts for
12 papers
Approximately Efficient Bilateral Trade with Samples
Yuan Deng, Jieming Mao, Balasubramanian Sivan +2
We study the social efficiency of bilateral trade between a seller and a buyer. In the classical Bayesian setting, the celebrated Myerson-Satterthwaite impossibility theorem states…
Multi-Dimensional Screening with Endogenous Information Disclosure
Yang Cai, Yingkai Li, Jinzhao Wu
We study multi-product monopoly pricing where the seller jointly designs the selling mechanism and the information structure for the buyer to learn his values. Unlike the case with…
Sample-Based Matroid Prophet Inequalities
Hu Fu, Pinyan Lu, Zhihao Gavin Tang +3
We study matroid prophet inequalities when distributions are unknown and accessible only through samples. While single-sample prophet inequalities for special matroids are known, n…
Algorithmic Information Disclosure in Optimal Auctions
Yang Cai, Yingkai Li, Jinzhao Wu
This paper studies a joint design problem where a seller can design both the signal structures for the agents to learn their values, and the allocation and payment rules for sellin…
Simultaneous Auctions are Approximately Revenue-Optimal for Subadditive Bidders
Yang Cai, Ziyun Chen, Jinzhao Wu
We study revenue maximization in multi-item auctions, where bidders have subadditive valuations over independent items. Providing a simple mechanism that is approximately revenue-o…
On the Optimal Fixed-Price Mechanism in Bilateral Trade
Yang Cai, Jinzhao Wu
We study the problem of social welfare maximization in bilateral trade, where two agents, a buyer and a seller, trade an indivisible item. We consider arguably the simplest form of…
(Fractional) Online Stochastic Matching via Fine-Grained Offline Statistics
Zhihao Gavin Tang, Hongxun Wu, Jinzhao Wu
Motivated by display advertising on the internet, the online stochastic matching problem is proposed by Feldman, Mehta, Mirrokni, and Muthukrishnan (FOCS 2009). Consider a stochast…
Oblivious Online Contention Resolution Schemes
Hu Fu, Pinyan Lu, Zhihao Gavin Tang +4
Contention resolution schemes (CRSs) are powerful tools for obtaining "ex post feasible" solutions from candidates that are drawn from "ex ante feasible" distributions. Online cont…
Eliciting Thinking Hierarchy without a Prior
Yuqing Kong, Yunqi Li, Yubo Zhang +2
When we use the wisdom of the crowds, we usually rank the answers according to their popularity, especially when we cannot verify the answers. However, this can be very dangerous w…
Low-overhead pieceable fault-tolerant construction of logical controlled-phase circuit for degenerate quantum code
Chen Lin, Guowu Yang
We designed an search algorithm in order to find a non-transversal but fault-tolerant construction of a logical controlled-phase gate for general [[n,1,d]] degenerate quantum code.…
A Canonical-based NPN Boolean Matching Algorithm Utilizing Boolean Difference and Cofactor Signature
Juling Zhang, Guowu Yang, William N. N. Hung +1
This paper presents a new compact canonical-based algorithm to solve the problem of single-output completely specified NPN Boolean matching. We propose a new signature vector Boole…
Realizing Ternary Quantum Switching Networks without Ancilla Bits
Guowu Yang, Xiaoyu Song, Marek Perkowski +1
This paper investigates the synthesis of quantum networks built to realize ternary switching circuits in the absence of ancilla bits. The results we established are twofold. The fi…