{"id":"W2950333913","doi":"10.48550/arxiv.1311.6883","title":"Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Incentive compatibility; Mechanism design; Computer science; Mathematical optimization; Common value auction; Bayesian probability; Payment; Mechanism (biology); Incentive; Procurement; Black box; Bayesian game; Operations research; Game theory; Mathematics; Mathematical economics; Artificial intelligence; Economics; Microeconomics; Repeated game","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.01275209,0.001961378,0.002990829,0.001293831,0.0006653516,0.002885982,0.003122148,0.00357688,0.002523327],"category_scores_gemma":[0.03729017,0.001547121,0.002146768,0.001966108,0.002602096,0.005422827,0.003106813,0.003418013,0.0005344108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001501209,"about_ca_system_score_gemma":0.002069226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002879663,"about_ca_topic_score_gemma":0.0002260133,"domain_scores_codex":[0.9907947,0.005893641,0.0003702005,0.001126197,0.001360105,0.0004552325],"domain_scores_gemma":[0.9777129,0.01565811,0.00292875,0.002216482,0.0008868903,0.0005969822],"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.0002657111,0.0003298466,0.0008678753,0.0003385615,0.0002061141,0.0001276795,0.0002115571,0.6671691,0.002871162,0.2866484,0.001163497,0.03980052],"study_design_scores_gemma":[0.00008998192,0.0002104196,0.0001308009,0.00004000356,0.0000276871,0.00007400222,0.00003082701,0.8015541,0.001109237,0.195862,0.0008464789,0.00002451505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01162596,0.0001205523,0.9867265,0.0002138355,0.00001394482,0.00009346558,0.00004210172,0.00007739676,0.001086249],"genre_scores_gemma":[0.4427092,0.0005329945,0.5532168,0.0003219705,0.000125304,0.0008950455,0.0002137279,0.00008462103,0.001900315],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01275209,"threshold_uncertainty_score":0.06744027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2184438121252616,"score_gpt":0.2333343330758164,"score_spread":0.01489052095055482,"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."}}