{"id":"W2905815131","doi":"10.1287/ijoc.2022.1168","title":"Dynamic Relaxations for Online Bipartite Matching","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Matching (statistics); Bipartite graph; Heuristic; Set (abstract data type); Variety (cybernetics); Revenue; Mathematical optimization; Online algorithm; Theoretical computer science; Operations research; Mathematics; Algorithm; Economics; Artificial intelligence","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":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008178562,0.00009367611,0.0001142164,0.0002733364,0.001469765,0.0003681316,0.0006962806,0.00001873657,0.00003015923],"category_scores_gemma":[0.00007943745,0.00008202166,0.00009806188,0.0004167246,0.00001146842,0.000486031,0.0003407237,0.0005238474,0.00001123565],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001647089,"about_ca_system_score_gemma":0.0001348489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000211672,"about_ca_topic_score_gemma":0.000001728415,"domain_scores_codex":[0.998688,0.00004378407,0.0004204536,0.0001396136,0.0004009388,0.0003072321],"domain_scores_gemma":[0.999072,0.000194228,0.000306084,0.0001865289,0.0001270547,0.000114072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008020955,0.00006704353,0.00003814736,0.000006033922,0.00001492273,0.000006602542,0.001165106,0.8729939,0.00002955917,0.03441894,0.0004871732,0.09076456],"study_design_scores_gemma":[0.0004804631,0.00023777,0.0001561248,0.00002188097,0.000001645981,0.0001666109,0.0001363359,0.9616818,0.000005793968,0.008965313,0.02803161,0.0001146566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03202668,0.00002507542,0.9633417,0.00282621,0.0007714966,0.0001789107,0.000007346055,0.0001171769,0.0007053881],"genre_scores_gemma":[0.5121785,0.00001779343,0.4839013,0.003162156,0.0001164911,0.00001009824,0.00002338577,0.00001800097,0.0005723234],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4801518,"threshold_uncertainty_score":0.9998302,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02570428253769788,"score_gpt":0.3076645937080267,"score_spread":0.2819603111703288,"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."}}