activity
20172026
most citedEnvy-Free House Allocation with Minimum Subsidy

3 citations · 6 across the 10 of their papers we have counts for

collaborators

12 papers

cs.GT2026

Envy-Free Allocation of Indivisible Goods via Noisy Queries

Zihan Li, Yan Hao Ling, Jonathan Scarlett +1

We introduce a problem of fairly allocating indivisible goods (items) in which the agents' valuations cannot be observed directly, but instead can only be accessed via noisy querie…

cs.IT2025

Statistical Mean Estimation with Coded Relayed Observations

Yan Hao Ling, Zhouhao Yang, Jonathan Scarlett

We consider a problem of statistical mean estimation in which the samples are not observed directly, but are instead observed by a relay (``teacher'') that transmits information th…

cs.IT2025

Error Exponents for DNA Storage Codes with a Variable Number of Reads

Yan Hao Ling, Nir Weinberger, Jonathan Scarlett

In this paper, we study error exponents for a concatataned coding based class of DNA storage codes in which the number of reads performed can be variable. That is, the decoder can…

cs.IT2024

Exact Error Exponents of Concatenated Codes for DNA Storage

Yan Hao Ling, Jonathan Scarlett

In this paper, we consider a concatenated coding based class of DNA storage codes in which the selected molecules are constrained to be taken from an ``inner'' codebook associated…

cs.GT2024★ 3 cited

Envy-Free House Allocation with Minimum Subsidy

Davin Choo, Yan Hao Ling, Warut Suksompong +2

House allocation refers to the problem where houses are to be allocated to agents so that each agent receives one house. Since an envy-free house allocation does not always…

cs.IT2023

Optimal 1-bit Error Exponent for 2-hop Relaying with Binary-Input Channels

Yan Hao Ling, Jonathan Scarlett

In this paper, we study the problem of relaying a single bit over a tandem of binary-input channels, with the goal of attaining the highest possible error exponent in the exponenti…