The second-best bilateral trade mechanism captures at least 1/2 of first-best gains from trade, and the bound is tight.
Learning From Satisfy- ing Assignments Under Continuous Distributions
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
verdicts
UNVERDICTED 5representative citing papers
d^{poly(ℓ/ε)} algorithms for exponential families under polynomial-approximable unknown truncation, including first results for arbitrary Gaussians; poly(d/ε) for halfspaces/rectangles.
Buyer-offering mechanisms with reserve prices achieve a 0.746-approximation to welfare in bilateral trade, surpassing fixed-price limits.
G-Lox extends Lox-style bridge distribution with hidden group-adaptive assignment via two-server DPF/FSS and 2PC, showing low overhead and improved robustness in simulations.
SPIDER transforms a stateful single-server PIR protocol into one that delivers two-server-like private retrieval functionality using only a standard single server at no extra deployment cost.
citing papers explorer
-
Second-Best Bilateral Trade is $1/2$ Efficient
The second-best bilateral trade mechanism captures at least 1/2 of first-best gains from trade, and the bound is tight.
-
Welfare Maximization in Bilateral Trade: Improved Approximation Guarantees Beyond the Fixed Price Barrier
Buyer-offering mechanisms with reserve prices achieve a 0.746-approximation to welfare in bilateral trade, surpassing fixed-price limits.
-
G-Lox: Group-Adaptive, Privacy-Preserving Bridge Distribution with Two-Party Computation
G-Lox extends Lox-style bridge distribution with hidden group-adaptive assignment via two-server DPF/FSS and 2PC, showing low overhead and improved robustness in simulations.
-
SPIDER: Two Server Functionality for the Cost of Zero
SPIDER transforms a stateful single-server PIR protocol into one that delivers two-server-like private retrieval functionality using only a standard single server at no extra deployment cost.