{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01164738,0.001785296,0.002903613,0.001276456,0.0006463412,0.002857652,0.002998567,0.003432322,0.002316328],"category_scores_gemma":[0.03465513,0.001588016,0.002165706,0.001837965,0.002309996,0.005425361,0.002884679,0.00299673,0.0005223567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445616,"about_ca_system_score_gemma":0.002220381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003134954,"about_ca_topic_score_gemma":0.0002504257,"domain_scores_codex":[0.9914278,0.005179152,0.0003680296,0.001049021,0.001485525,0.0004903899],"domain_scores_gemma":[0.9807912,0.01297657,0.002671445,0.002105024,0.0008766407,0.0005790926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002352537,0.0002832835,0.0007343678,0.0003241957,0.0001749219,0.0001296956,0.0002005809,0.7398465,0.003213075,0.2145175,0.001006153,0.03933442],"study_design_scores_gemma":[0.00008516304,0.0002176769,0.000118522,0.00003694257,0.00002729336,0.00007640316,0.00003153723,0.8427047,0.001180649,0.1546121,0.0008860978,0.00002293803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01112225,0.0001264307,0.9873961,0.0001652429,0.00001359821,0.00009548708,0.00003567752,0.00008451881,0.0009606985],"genre_scores_gemma":[0.4505697,0.0005170255,0.5458203,0.0002796619,0.0001011361,0.0008569323,0.0001881035,0.00008335489,0.001583787],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01164738,"threshold_uncertainty_score":0.061598,"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."}}