AI Paper Atlas

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

Weakest Bidder Types and New Core-Selecting Combinatorial Auctions

Siddharth Prasad, Maria Florina Balcan, Tuomas Sandholm

AAAI 2026 · Learning theory and algorithms › Submodular and game algorithms · approach: Learned auction design · 2 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
use BPS formulation instead of BO formulation for WT computation (ablation)constraint generation for WT · CATS, 64 goods/250 bidsrun-time GM (s): 7.3 -> 4.0Improved
use BPS formulation instead of BO formulation for WT computation (ablation)constraint generation for WT · CATS, 128 goods/500 bidsrun-time GM (s): 110.6 -> 46.9Improved
use BPS formulation instead of BO formulation for WT computation (ablation)constraint generation for WT · CATS, 128 goods/500 bidsCG iterations GM: 164.2 -> 59.8Improved
use BPS formulation instead of BO formulation for WT computation (ablation)constraint generation for WT · CATS, 64 goods/500 bidsCG iterations GM: 102.5 -> 45.8Improved
increase type space constraint density beta from 0.2 to 0.8 (ablation)WT computation (BPS) · CATS, K=8run-time GM (s): 9.9 -> 15.3Hurt
increase type space constraint density beta from 0.2 to 0.8 (ablation)WT computation (BPS) · CATS, K=8CG iterations GM: 32.0 -> 75.3Hurt
vary number of type space constraints K (ablation)WT computation · CATSrun-time and CG iterations: 19.7 seconds and 42.7 iterations (GM over all K)No clear effect
compute MRC around WT price (WT nearest) instead of around VCG price (vanilla VCG nearest) (ablation)core-selecting payment rule · CATS, K=8run-time GM (s): 1.7 -> 1.0Improved
increase number of type space constraints K from 1 to 16 (ablation)WT in the core · CATSfraction WT in core but VCG not (%): 2.00% -> 4.18%Improved
use WT-based MRC rules (more type space constraints, K up to 16) instead of vanilla MRC (ablation)MRC(p^WT)-selecting rules · CATSrevenue: nearly closing half the gap between MRC revenue and efficient social welfare at K=16Improved
use MRC(p^WT) instead of vanilla MRC when K<=8 (ablation)MRC(p^WT)-selecting rules · CATSrevenueNo clear effect
add type space constraints (larger K) to MRC(p^WT) rules (ablation)MRC(p^WT)-selecting rules · CATSsum of incentives to deviateImproved

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