{"id":"W2962931423","doi":"10.1007/978-3-030-17953-3_31","title":"Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"","keywords":"Computer science; Matching (statistics); Polynomial; Time complexity; Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Statistics","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.001943346,0.0002894085,0.0007737647,0.0005230299,0.0001159458,0.0001324303,0.001027734,0.0002091566,0.0000929396],"category_scores_gemma":[0.00007203907,0.0002470474,0.0001060185,0.0003040647,0.0004668228,0.0001456119,0.0003550723,0.000608456,0.000235817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001655923,"about_ca_system_score_gemma":0.0001210507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001439541,"about_ca_topic_score_gemma":0.00004385113,"domain_scores_codex":[0.9979403,0.00003886959,0.0008455213,0.0007054062,0.0001048527,0.0003650555],"domain_scores_gemma":[0.998073,0.0006507873,0.0006483278,0.0005380952,0.00005211352,0.00003766355],"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.0001115718,0.0001381691,0.007116399,0.000354087,0.0001295129,0.00004495412,0.0274235,0.2504739,0.0005139657,0.6169849,0.0001044676,0.09660462],"study_design_scores_gemma":[0.001133384,0.0002936596,0.002691715,0.001758236,0.000009084433,0.00004260235,0.00000648823,0.7782258,0.0005885088,0.2115256,0.002495365,0.001229537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1410667,0.002290306,0.7903977,0.0007529979,0.004062768,0.001358053,0.00009653851,0.00007949436,0.05989541],"genre_scores_gemma":[0.9948165,0.000009436183,0.003360683,0.000291043,0.0002794759,0.000001108376,0.000003688952,0.00002937675,0.001208657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8537498,"threshold_uncertainty_score":0.9999982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01492737701452467,"score_gpt":0.2122742775948551,"score_spread":0.1973469005803304,"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."}}