{"id":"W1502128320","doi":"10.1145/2790133","title":"Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Economics and Computation","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science","keywords":"Incentive compatibility; Mechanism design; Mathematical optimization; Computer science; Bayesian probability; Common value auction; Incentive; Payment; Procurement; Mechanism (biology); Black box; Bayesian game; Game theory; Mathematics; Artificial intelligence; Mathematical economics; Economics; Repeated game; Microeconomics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005721188,0.00009332952,0.0001245838,0.00008296493,0.0003432855,0.0002384896,0.0001004587,0.00005207854,0.00000715637],"category_scores_gemma":[0.00002969103,0.00008116564,0.00002227082,0.0001156052,0.00006790701,0.0002836956,0.000004608878,0.00006646356,0.00001142185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002872468,"about_ca_system_score_gemma":0.00005672182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008510618,"about_ca_topic_score_gemma":0.00001015172,"domain_scores_codex":[0.9992737,0.00003417683,0.0002306813,0.0002898924,0.00007369545,0.00009784792],"domain_scores_gemma":[0.999042,0.0004881709,0.0001204704,0.0001475797,0.0001015411,0.0001002093],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001184487,0.00002281096,0.000007092439,0.000001222288,0.00001593665,7.58121e-8,0.0004414944,0.9528016,0.000009628704,0.005193889,0.00002443557,0.04136337],"study_design_scores_gemma":[0.0008427809,0.0003252088,0.00006741517,0.000005094882,0.00002084832,0.00002145976,0.0007706536,0.8949242,0.0002319372,0.1019871,0.0006901089,0.0001132665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.253918,0.000008462543,0.7452527,0.000380028,0.00007694299,0.0002947534,0.00001410937,0.00002304512,0.00003198599],"genre_scores_gemma":[0.9136999,0.00002367878,0.08595219,0.00007513996,0.00001161309,0.00006932432,0.000005590179,0.00001045268,0.0001521361],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6597819,"threshold_uncertainty_score":0.3309838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1369093610987062,"score_gpt":0.3031928847846375,"score_spread":0.1662835236859314,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}