The Quadratic Core-Selecting Payment Rule for Combinatorial Auctions

Abstract

We report on the use of a quadratic programming technique in recent and upcoming spectrum auctions in Europe, and proposed for use in the FAA’s landing-slot auctions in the United States. Specifically, we compute a unique point “in the core” that minimizes the sum of squared deviations from the Vickrey-Clarke-Groves payments. Analyzing the Karush-Kuhn-Tucker conditions, we demonstrate that the resulting payments can be decomposed into a series of economically meaningful and equitable penalties, adding to the perceived “fairness” of this payment rule. Further, we discuss the many benefits of this combinatorial auction paradigm.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 35 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.