{"id":"W2949563967","doi":"10.1007/978-3-030-17953-3_21","title":"An Efficient Characterization of Submodular Spanning Tree Games","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Submodular set function; Shapley value; Characterization (materials science); Game tree; Computer science; Convexity; Mathematical economics; Spanning tree; Tree (set theory); Cooperative game theory; Time complexity; Core (optical fiber); Mathematics; Game theory; Regular polygon; Combinatorics; Sequential game; Economics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001285978,0.0004357027,0.0006094222,0.001061748,0.0001616907,0.0006269913,0.00536252,0.0002524005,0.000004966936],"category_scores_gemma":[0.00007864294,0.0004212535,0.0001580093,0.002079405,0.0005316467,0.0005251365,0.003183532,0.0007754614,0.000006128491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000140977,"about_ca_system_score_gemma":0.0005329454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006525268,"about_ca_topic_score_gemma":0.00001361942,"domain_scores_codex":[0.99572,0.0001704117,0.0006226781,0.001756198,0.001076714,0.0006539656],"domain_scores_gemma":[0.9963592,0.0001932331,0.0004706305,0.002502856,0.0003276551,0.0001463757],"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.000004352685,0.0001616006,0.001523048,0.00009889405,0.00000667019,0.00001102932,0.002202604,0.6581351,0.01292732,0.001168394,3.118199e-7,0.3237607],"study_design_scores_gemma":[0.0001791286,0.0001377226,0.02592685,0.0004019552,0.000004124785,0.00001155839,5.355012e-7,0.9338801,0.02910593,0.009911696,0.000009945497,0.0004304741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3190677,0.00006107493,0.6780735,0.0001819144,0.002141467,0.0003389454,0.000007716989,0.0001171516,0.00001051563],"genre_scores_gemma":[0.6981218,0.000007255228,0.3014768,0.0001843011,0.0001737538,0.000009124513,0.00001462761,0.00001198704,3.909531e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.379054,"threshold_uncertainty_score":0.9998239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01676588217267796,"score_gpt":0.257172427004477,"score_spread":0.240406544831799,"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."}}