AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Limitations of Incentive Compatibility on Discrete Type Spaces

Taylor Lundy, Hu Fu

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: Structure and complexity of constraint reasoning · 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
Require DSIC only on the discrete type space, then seek an extension to its convex hullConstructed multidimensional mechanism with non-downward-closed feasibility · Discrete type space to convex hullDSIC extension existenceHurt
Allow randomized allocations in the convex-hull extensionSeven-dimensional constructed mechanism · Discrete type space to convex hullDSIC extension existenceNo clear effect
Use a downward-closed feasible allocation setDSIC mechanism on a discrete type space · Discrete type space to convex hullDSIC extension existenceImproved
Use a single swap feasible allocation setDSIC mechanism on a discrete type space · Discrete type space to convex hullDSIC extension existenceImproved
Enforce DSIC and IR on the support rather than the convex hullRevenue-maximizing mechanism · Constructed single-agent revenue exampleExpected revenue: \OPT(\mathscr{F},\mathbf{D}) \geq \alpha \widetilde{\OPT}(\mathscr{F}, \mathbf{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