{"id":"W4393132206","doi":"10.1016/j.tcs.2024.114476","title":"On the complexity of nucleolus computation for bipartite b-matching games","year":2024,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Combinatorics; Matching (statistics); Mathematics; Complement (music); Computation; Discrete mathematics; 3-dimensional matching; Bounded function; Simple (philosophy); Time complexity; Algorithm; Graph","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.003035899,0.00009136341,0.0002024152,0.0001306612,0.0002148227,0.0001982195,0.0004334607,0.00002633886,0.0000681528],"category_scores_gemma":[0.0001321169,0.00006740331,0.00008754455,0.0003833281,0.00240868,0.0001245528,0.00009067575,0.0001013854,0.000140553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002997476,"about_ca_system_score_gemma":0.00001590644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006517839,"about_ca_topic_score_gemma":3.196781e-7,"domain_scores_codex":[0.9989672,0.00003890936,0.0003550862,0.0003373477,0.00007229864,0.000229215],"domain_scores_gemma":[0.9987605,0.0008360735,0.00009174518,0.000223568,0.00003841966,0.0000496932],"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.00001027082,0.00002020887,0.0000163757,0.00004191581,0.000007084984,3.548491e-7,0.0007868835,0.0007982401,0.00005938658,0.9970093,0.00007680366,0.001173185],"study_design_scores_gemma":[0.00004720263,0.00008473575,0.0001770675,0.00005709633,0.000001448053,0.000001776232,0.00001117267,0.3583602,0.000259612,0.6408162,0.0001260973,0.00005739068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3008699,0.00007953486,0.692304,0.001314889,0.0007176957,0.0001904667,0.0000277314,0.00005657881,0.00443924],"genre_scores_gemma":[0.9954339,0.000001046138,0.004221666,0.0002104584,0.0000992585,0.000007470531,0.000001186242,0.000009005697,0.00001599519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.694564,"threshold_uncertainty_score":0.8874883,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06221616489038218,"score_gpt":0.2716958774834759,"score_spread":0.2094797125930937,"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."}}