AI Paper Atlas

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

Probably Approximately Efficient Combinatorial Auctions via Machine Learning

Gianluca Brero, Benjamin Lubin, Sven Seuken

AAAI 2017 · Learning theory and algorithms › Submodular and game algorithms · approach: Learned auction design · 11 citations (OpenAlex)

Read the paper

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
add SVR generalization of bids instead of XOR bidsOne-shot Poly-2 auction · GSVM Full-Random q=40efficiency: 43% -> 92%Improved
add SVR generalization of bids instead of XOR bidsOne-shot Exp auction · LSVM Pos-Random q=40efficiency: 75% -> 82%Improved
add iterative querying of allocated bundlesExp-kernel one-shot auction · LSVM Pos-Random q=40efficiency: 82% -> 92%Improved
add iterative querying of allocated bundlesGaussian-kernel one-shot auction · GSVM Pos-Random q=40efficiency: 86% -> 87%No clear effect
use Exp kernel instead of Gaussian kernelOne-shot SVR auction · LSVM Full-Random q=40efficiency: 51% -> 70%Improved
use Poly-2 kernel instead of Gaussian kernelOne-shot SVR auction · GSVM Full-Random q=40efficiency: 83% -> 92%Improved
sample from bidder's bundles of interest (Pos-Random) instead of full spaceOne-shot Exp auction · GSVM q=40efficiency: 86% -> 99%Improved
increase number of initial queries q from 10 to 40One-shot Exp auction · GSVM Full-Randomefficiency: 57% -> 86%Improved
increase insensitivity threshold zeta from 0.1 to 10 (ablation)Iterative Exp auction · LSVM Full-Random q=40runtime: 484.1 -> 53.5Improved
increase insensitivity threshold zeta from 0.1 to 10 (ablation)Iterative Exp auction · LSVM Full-Random q=40efficiency: 77% -> 74%Hurt
increase insensitivity threshold zeta from 0.1 to 10 (ablation)Iterative Gaus auction · LSVM Full-Random q=40efficiency: 64% -> 69%Improved
tune hyperparameters on the wrong value model (ablation)Iterative Exp auction · GSVM Full-Random q=10efficiency: -6%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