A duality-based unified approach to Bayesian mechanism design
Bibliographic record
Abstract
In this letter we briefly survey our recent work [Cai et al. 2016]. In it, we provide a new duality theory for Bayesian mechanism design which is quite general, and applies for any objective the designer wishes to optimize, and for arbitrary agent valuations. We then apply our theory to auction design settings with many independent buyers who have independent values for many items, and are able to provide a unified proof of several recent exciting works on this front [Hart and Nisan 2012; Li and Yao 2013; Babaioff et al. 2014; Yao 2015; Chawla et al. 2007; Chawla et al. 2010; Chawla et al. 2015]. These works all show that simple mechanisms are approximately optimal in various settings. In some cases, our principled approach yields greatly improved approximation ratios as well.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.010 | 0.019 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.003 |
| Bibliometrics | 0.003 | 0.004 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.004 | 0.007 |
| Open science | 0.004 | 0.004 |
| Research integrity | 0.003 | 0.008 |
| Insufficient payload (model declined to judge) | 0.007 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".