atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Don't Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond

NeurIPS 2022 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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
Use two cardinal queries per agent, targeting their favorite item and a sufficiently representative assignmentOne-Sided Matching · One-Sided Matchingdistortion: O(\sqrt n)Helped
Use two cardinal queries per agent with a sufficiently representative assignmentOrdinal-k-Max-on-Graphs · Ordinal-k-Max-on-Graphsdistortion: O(\sqrt{n})Helped
Use two queries based on a sufficiently representative set of alternativesGeneral social choice when m = Ω(n) · General social choice (m = Ω(n))distortion: O(\sqrt{m})Helped
Limit a deterministic mechanism to at most λ queries per agentOrdinal-k-Max-on-Graphs · Ordinal-k-Max-on-Graphsdistortion lower bound: \Omega(n^{1/\lambda})Hurt
Limit a deterministic mechanism to a constant number λ of queries per agentGeneral social choice · General social choicedistortion lower bound: \Omega(m^{1/\lambda})Hurt

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