{"id":"W1502380032","doi":"10.1007/978-3-642-20798-3_7","title":"Strategyproof Mechanisms for Content Delivery via Layered Multicast","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Revenue; Maximization; Mathematical optimization; Mechanism design; Approximation algorithm; Computer network; Algorithm; 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.006217694,0.001439626,0.001230292,0.001303358,0.001406898,0.005076035,0.005025988,0.002881292,0.005776737],"category_scores_gemma":[0.01881148,0.001132469,0.001263206,0.002161758,0.00261253,0.00756011,0.004936748,0.004310552,0.001366688],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002379692,"about_ca_system_score_gemma":0.001571343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005310142,"about_ca_topic_score_gemma":0.0004911373,"domain_scores_codex":[0.9938692,0.002414846,0.0004137221,0.0004287309,0.002166267,0.0007072451],"domain_scores_gemma":[0.986415,0.008716403,0.001010424,0.002658894,0.0008160445,0.0003832183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001411411,0.00009699735,0.0001498066,0.0002140802,0.00005640016,0.00007904335,0.0001776326,0.02362745,0.00335861,0.9189378,0.004464798,0.04869631],"study_design_scores_gemma":[0.0001118766,0.0000511749,0.00008427038,0.00004759579,0.00004514878,0.0001145877,0.00002498272,0.1502089,0.001818977,0.8421368,0.005317468,0.00003828626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0114907,0.0009972447,0.9731118,0.0009109081,0.0001514834,0.000136697,0.00009581509,0.0008079248,0.01229743],"genre_scores_gemma":[0.6445376,0.002027298,0.3355928,0.0003454908,0.0006411527,0.0008189562,0.0002129254,0.0003261752,0.01549768],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006217694,"threshold_uncertainty_score":0.03288269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.167402398657824,"score_gpt":0.3350447582413962,"score_spread":0.1676423595835722,"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."}}