Pith. sign in

REVIEW 1 cited by

(Almost) Efficient Mechanisms for Bilateral Trading

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1604.04876 v3 pith:LB5Q5ROC submitted 2016-04-17 cs.GT

classification cs.GT
keywords mechanismsproblembilateralmechanismsimplealmostapproximateapproximation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study the bilateral trade problem: one seller, one buyer and a single, indivisible item for sale. It is well known that there is no fully-efficient and incentive compatible mechanism for this problem that maintains a balanced budget. We design simple and robust mechanisms that obtain approximate efficiency with these properties. We show that even minimal use of statistical data can yield good approximation results. Finally, we demonstrate how a mechanism for this simple bilateral-trade problem can be used as a "black-box" for constructing mechanisms in more general environments.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bilateral Trade Under Heavy-Tailed Valuations: Minimax Regret with Infinite Variance

    stat.ML 2026-03 unverdicted novelty 7.0 of 10

    Under bounded density and finite p-th moments with p in (1,2), contextual bilateral trade has exact minimax regret rate T to the power 1 minus 2β(p-1)/(βp + d(p-1)).

Pith tools