{"id":"W4213194262","doi":"10.1007/s00453-019-00636-y","title":"Stable Matchings with Covering Constraints: A Complete Computational Trichotomy","year":2020,"lang":"en","type":"article","venue":"Algorithmica","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"European Research Council; Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg; Deutsche Forschungsgemeinschaft","keywords":"Trichotomy (philosophy); Parameterized complexity; Combinatorics; Mathematics; Matching (statistics); Time complexity; Bipartite graph; Stable marriage problem; Theory of computation; Discrete mathematics; Corollary; Computational complexity theory; Algorithm; Graph; Statistics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004834352,0.002183893,0.003458593,0.00168582,0.002521186,0.008276094,0.006406039,0.003971564,0.03000367],"category_scores_gemma":[0.02890636,0.001755389,0.007891786,0.003565747,0.003375799,0.01704208,0.007155932,0.0108372,0.003639761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004760298,"about_ca_system_score_gemma":0.00503831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004467212,"about_ca_topic_score_gemma":0.004385558,"domain_scores_codex":[0.9909774,0.002805542,0.0005992617,0.002415707,0.001990729,0.001211312],"domain_scores_gemma":[0.95538,0.0368242,0.001510411,0.004354939,0.001140067,0.0007904512],"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.001181691,0.0009872899,0.003503486,0.002311938,0.0003886939,0.0008039078,0.001461719,0.1205873,0.007453258,0.7205806,0.0413008,0.09943932],"study_design_scores_gemma":[0.0002416683,0.00009565368,0.0004062814,0.00008160115,0.00009770142,0.0003335513,0.0001962914,0.1862274,0.001577427,0.8032188,0.007466455,0.00005711676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09142114,0.001016143,0.8416747,0.01789867,0.000235189,0.001223345,0.006093388,0.003088949,0.03734845],"genre_scores_gemma":[0.4523406,0.001688908,0.5122153,0.004286734,0.001030829,0.002352412,0.00909988,0.00178311,0.01520212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03000367,"threshold_uncertainty_score":0.1003723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03579816660532784,"score_gpt":0.2010768990384529,"score_spread":0.165278732433125,"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."}}