AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

On Infinite Separations Between Simple and Optimal Mechanisms

Alexandros Psomas, Ariel Schvartzman, S. Matthew Weinberg

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Construct a sequence from the support of an arbitrary distributionMenuGap characterization · Arbitrary distribution DMenuGap(X) lower bound: MenuGap(X) ≥ rev(D)/(9 brev(D))Improved
Allow allocation vectors Q to be unaligned with valuation vectors XConstructed sequence X in [0,1]^2 · Two-dimensional sequence constructionMenuGap(X): ∞Improved
Require allocation vectors Q to be aligned with valuation vectors XConstructed sequence X in [0,1]^2 · Two-dimensional sequence constructionScalarGap(X): ∞ vs. ≤ 6Hurt
Use the constructed sequence to generate a distribution with infinite optimal-to-bundle revenue separationTwo-item correlated distributions · Two itemsrev(D)/arev(D): ∞Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy