{"id":"W3161072239","doi":"10.48550/arxiv.2105.07161","title":"On the Complexity of Nucleolus Computation for Bipartite b-Matching Games","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Social Sciences and Humanities Research Council; University of Waterloo","funders":"","keywords":"Bipartite graph; Matching (statistics); Combinatorics; Complement (music); Computation; Mathematics; 3-dimensional matching; Simple (philosophy); Bounded function; Blossom algorithm; Discrete mathematics; Algorithm; Graph","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.003195946,0.00136203,0.002445335,0.001493686,0.002011382,0.006127841,0.00330284,0.002604834,0.01215278],"category_scores_gemma":[0.0263465,0.0009711652,0.002072065,0.002606475,0.002770233,0.0104074,0.004186061,0.004553076,0.001326479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003644131,"about_ca_system_score_gemma":0.003336309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005702118,"about_ca_topic_score_gemma":0.005669994,"domain_scores_codex":[0.9957878,0.001631747,0.0002374946,0.0008792313,0.0005955407,0.0008680962],"domain_scores_gemma":[0.95502,0.03899051,0.001563513,0.002520548,0.0008710876,0.001034482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002489773,0.000881628,0.006686147,0.001194784,0.0003669143,0.0004650676,0.001026149,0.4346749,0.01045236,0.4261633,0.01829691,0.0973021],"study_design_scores_gemma":[0.0001423827,0.00006299735,0.0004752336,0.00003816281,0.00004332314,0.0000854872,0.0001222733,0.5305325,0.001552295,0.4656991,0.001209889,0.00003639344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3914481,0.00130709,0.5669398,0.006300133,0.0002452841,0.0006830122,0.001939888,0.001831179,0.02930558],"genre_scores_gemma":[0.8017654,0.0009474875,0.1877188,0.0008617602,0.0002557379,0.0005899582,0.002032209,0.0006566335,0.005171967],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01215278,"threshold_uncertainty_score":0.04065514,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.212027328101333,"score_gpt":0.2038191274568907,"score_spread":0.008208200644442304,"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."}}