{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002684089,0.0001401319,0.0003481629,0.00006211426,0.0001092662,0.00008825371,0.0001815296,0.00004367655,0.0004836404],"category_scores_gemma":[0.00004255074,0.0001496644,0.00005562706,0.000228325,0.00009910664,0.0001659997,0.00003653992,0.0001549024,0.0008229136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003569912,"about_ca_system_score_gemma":0.00002122917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006463527,"about_ca_topic_score_gemma":5.825458e-7,"domain_scores_codex":[0.9989519,0.00001970809,0.0003943061,0.0003392596,0.00004979236,0.0002450316],"domain_scores_gemma":[0.999396,0.0001013037,0.0002302539,0.0001190639,0.00002968078,0.0001237218],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001518111,0.00012952,0.01289425,0.000207931,0.000362451,0.00007704338,0.004199154,0.009213496,0.0001183376,0.9675328,0.001923112,0.003190068],"study_design_scores_gemma":[0.01036078,0.001104483,0.01354501,0.0002609732,0.00005527057,0.000386525,0.001880058,0.4645705,0.000292077,0.1788044,0.3261172,0.002622702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2241802,0.0003323819,0.7216154,0.002851186,0.0003034552,0.0006216927,0.0008990824,0.0003158534,0.0488807],"genre_scores_gemma":[0.9874281,0.000001852421,0.01117429,0.001029604,0.0001305767,0.00001331121,0.00003189542,0.00002497604,0.0001653572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7887284,"threshold_uncertainty_score":0.9999551,"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."}}