{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003958237,0.001125552,0.003266289,0.001626415,0.002766254,0.007568601,0.004114374,0.003487278,0.01948007],"category_scores_gemma":[0.04165243,0.001140699,0.002248396,0.002795986,0.003828489,0.01368346,0.005170875,0.005107373,0.001598902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003912686,"about_ca_system_score_gemma":0.004050268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006211453,"about_ca_topic_score_gemma":0.006147623,"domain_scores_codex":[0.9945527,0.002443333,0.0002795328,0.0009383258,0.0009071486,0.0008789707],"domain_scores_gemma":[0.9229717,0.06747692,0.002158486,0.004220392,0.001579357,0.001593173],"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.001525019,0.0004783091,0.002964477,0.0005017041,0.0001819164,0.0002047757,0.0007151865,0.180829,0.002437123,0.7549216,0.01611763,0.0391233],"study_design_scores_gemma":[0.00009276396,0.00003166765,0.000273027,0.00002488191,0.00002653836,0.00003885416,0.00008395284,0.268641,0.0003637374,0.7297276,0.0006717877,0.00002406795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4142324,0.001629718,0.5107768,0.01122086,0.0003959045,0.0004834145,0.002300265,0.00150988,0.05745082],"genre_scores_gemma":[0.9149051,0.0008049548,0.07264883,0.000924819,0.0003859054,0.000365648,0.001462655,0.0005232758,0.007978874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01948007,"threshold_uncertainty_score":0.06516737,"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."}}