MétaCan
Menu
Back to cohort
Record W2409015594 · doi:10.1145/2897518.2897645

A duality based unified approach to Bayesian mechanism design

2016· article· en· W2409015594 on OpenAlexafffund
Yang Cai, Nikhil R. Devanur, S. Matthew Weinberg

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldDecision Sciences
TopicAuction Theory and Applications
Canadian institutionsMcGill University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsMechanism designCommon value auctionBayesian probabilityComputer scienceDisjoint setsRevenueCompetitive analysisSimple (philosophy)Duality (order theory)Mathematical optimizationTheoretical computer scienceMathematical economicsMathematicsArtificial intelligenceCombinatoricsEconomicsUpper and lower boundsMicroeconomics

Abstract

fetched live from OpenAlex

We provide a unified view of many recent developments in Bayesian mechanism design, including the black-box reductions of Cai et. al., simple auctions for additive buyers, and posted-price mechanisms for unit-demand buyers. Additionally, we show that viewing these three previously disjoint lines of work through the same lens leads to new developments as well. First, we provide a duality framework for Bayesian mechanism design, which naturally accommodates multiple agents and arbitrary objectives/feasibility constraints. Using this, we prove that either a posted-price mechanism or the VCG auction with per-bidder entry fees achieves a constant-factor of the optimal Bayesian IC revenue whenever buyers are unit-demand or additive, unifying previous breakthroughs of Chawla et. al. and Yao, and improving both approximation ratios (from 33.75 to 24 and 69 to 8). Finally, we show that this view also leads to improved structural characterizations in the Cai et. al. framework.

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 imitation

Not 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.

metaresearch head score (Codex)0.008
metaresearch head score (Gemma)0.016
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.042

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.016
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0030.003
Science and technology studies0.0010.002
Scholarly communication0.0040.006
Open science0.0040.003
Research integrity0.0020.007
Insufficient payload (model declined to judge)0.0070.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.

Opus teacher head0.214
GPT teacher head0.382
Teacher spread0.168 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations107
Published2016
Admission routes2
Has abstractyes

Explore more

Same topicAuction Theory and ApplicationsFrench-language works237,207