The polyhedral geometry of truthful auctions

Abstract The difference set of an outcome in an auction is the set of types that the auction mechanism maps to the outcome. We give a complete characterization of the geometry of the difference sets that can appear for a dominant strategy incentive compatible multi-unit auction showing that they correspond to regular subdivisions of the unit cube. Similarly, we describe the geometry for affine maximizers for n players and m items, showing that they correspond to regular subdivisions of the m -fold product of $$(n-1)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> -dimensional simplices. These observations are then used to construct mechanisms that are robust in the sense that the sets of items allocated to the players change only slightly when the players’ reported types are changed slightly.

Authors

Institutions

Publication Details

Journal
Mathematical Programming
Published
2024-11-28
DOI
https://doi.org/10.1007/s10107-024-02168-y
Primary Topic
Auction Theory and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The polyhedral geometry of truthful auctions

Max Klimm, Michael Joswig, Sylvain Spitz
Mathematical Programming
Auction Theory and Applications
article

The polyhedral geometry of truthful auctions

Max Klimm, Michael Joswig, Sylvain Spitz
article en

Abstract

Abstract The difference set of an outcome in an auction is the set of types that the auction mechanism maps to the outcome. We give a complete characterization of the geometry of the difference sets that can appear for a dominant strategy incentive compatible multi-unit auction showing that they correspond to regular subdivisions of the unit cube. Similarly, we describe the geometry for affine maximizers for n players and m items, showing that they correspond to regular subdivisions of the m -fold product of $$(n-1)$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>-</mml:mo> <mml:mn>1</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> -dimensional simplices. These observations are then used to construct mechanisms that are robust in the sense that the sets of items allocated to the players change only slightly when the players’ reported types are changed slightly.

Mathematical ProgrammingVol. 210(1-2)
Max Planck Institute for Mathematics in the Sciences (DE), Technische Universität Berlin (DE)
Deutsche Forschungsgemeinschaft
Openalex Percentile: Top 74%
Auction Theory and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.