{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002332104,0.001977111,0.002478795,0.002150366,0.001432389,0.005886817,0.004617372,0.002276619,0.01244857],"category_scores_gemma":[0.01622526,0.001136492,0.002085251,0.003524497,0.001818929,0.01021603,0.004027561,0.005462934,0.0015548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003036637,"about_ca_system_score_gemma":0.002797533,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001724667,"about_ca_topic_score_gemma":0.002229726,"domain_scores_codex":[0.9965037,0.0009929546,0.0001901803,0.0007589604,0.0008872367,0.0006668802],"domain_scores_gemma":[0.9891879,0.007175493,0.0008139145,0.001095476,0.0008024522,0.0009247634],"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.0004368581,0.0005150476,0.002068849,0.0003982447,0.0001111929,0.0002251409,0.0005456993,0.05292113,0.00722335,0.8674479,0.01596055,0.05214612],"study_design_scores_gemma":[0.00005392316,0.00009198208,0.0004756327,0.00003702379,0.00003919104,0.0001547813,0.0001141496,0.2574064,0.001102024,0.737249,0.003248792,0.00002703915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2268069,0.000791257,0.7037059,0.003451796,0.0002190845,0.0008671341,0.003317335,0.001275477,0.05956509],"genre_scores_gemma":[0.8230034,0.0009964795,0.1509208,0.001012549,0.0005203543,0.0009197539,0.004089097,0.0006241956,0.01791334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01244857,"threshold_uncertainty_score":0.04164463,"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."}}