{"id":"W2264537082","doi":"10.1007/978-3-642-45046-4_31","title":"Near-Optimal and Robust Mechanism Design for Covering Problems with Correlated Players","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mechanism design; Mechanism (biology); Mathematical optimization; Theoretical computer science; Mathematical economics; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"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.009571583,0.002941231,0.003950967,0.001464346,0.0006918903,0.003652539,0.004555355,0.004298809,0.00473164],"category_scores_gemma":[0.0287882,0.002637045,0.002661914,0.002014442,0.002438948,0.005105183,0.003929889,0.004115247,0.000904149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002234202,"about_ca_system_score_gemma":0.002594617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005949473,"about_ca_topic_score_gemma":0.0004675843,"domain_scores_codex":[0.9937171,0.003688332,0.0002669883,0.0008413543,0.001072613,0.0004135335],"domain_scores_gemma":[0.9854049,0.01072606,0.001232755,0.001285621,0.00083833,0.0005122835],"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.000322557,0.0002078808,0.0003713288,0.0005674638,0.0002308982,0.0001324905,0.0001435672,0.6623294,0.003175921,0.2754339,0.003545651,0.05353897],"study_design_scores_gemma":[0.0000643346,0.0001357358,0.00007632028,0.00005528874,0.00003676094,0.00007194326,0.00001834169,0.7976331,0.000509073,0.2004852,0.0008865607,0.00002736451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004885644,0.000384345,0.992058,0.0001835533,0.0000366442,0.00009886237,0.00005778262,0.0001133116,0.002181889],"genre_scores_gemma":[0.4504109,0.001866716,0.5362437,0.00035072,0.0004057621,0.001148565,0.0003887977,0.0002813724,0.008903479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009571583,"threshold_uncertainty_score":0.05061996,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06572262632786496,"score_gpt":0.2812393622439819,"score_spread":0.215516735916117,"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."}}