AI Paper Atlas

Research map / Probabilistic and scientific modeling / Uncertainty and Gaussian processes

Fast Iterative Combinatorial Auctions via Bayesian Learning

Gianluca Brero, Sébastien Lahaie, Sven Seuken

AAAI 2019 · Probabilistic and scientific modeling › Uncertainty and Gaussian processes · approach: Nonparametric and PAC-Bayes Bayesian learning

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
Use Bayesian price updates with Monte Carlo EM instead of tuned subgradient price incrementsBayes^GEN versus SG-Auction^D · Multi-minded CATS domainsclearing and roundsImproved
Use Bayesian price updates with Monte Carlo EM instead of instance-optimized subgradient incrementsBayes^GEN versus SG-Auction^I · Multi-minded CATS domainsroundsMixed
Generalize the Bayesian design beyond single-minded biddersBayes^GEN versus Bayes^SM · Single-minded CATS domainsclearing: 88% vs 88%; 96% vs 96%; 77% vs 77%; 98% vs 98%No clear effect
Generalize the Bayesian design beyond single-minded biddersBayes^GEN versus Bayes^SM · Single-minded CATS domainsrounds: 5.2 (0.4) vs 4.9 (0.2); 4.6 (0.3) vs 4.3 (0.2); 4.5 (0.3) vs 4.2 (0.3); 6.3 (0.3) vs 6.1 (0.3)No clear effect
Increase the Monte Carlo EM sample count to at least ℓ = 2^4Bayes^GEN · Single-minded CATS domainsperformance versus Bayes^SM: ℓ = 2^4Improved

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