{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004263701,0.001622827,0.001650169,0.001229318,0.000934151,0.002388976,0.002528278,0.002049714,0.01439367],"category_scores_gemma":[0.0218693,0.001083035,0.001837027,0.001719683,0.001963412,0.003923446,0.002352258,0.004692044,0.001527614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003061032,"about_ca_system_score_gemma":0.001870055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002787227,"about_ca_topic_score_gemma":0.002196555,"domain_scores_codex":[0.9968129,0.00148219,0.0001249113,0.0005742181,0.0005710356,0.0004347364],"domain_scores_gemma":[0.9887438,0.008720591,0.0007669975,0.0007387864,0.0005360953,0.0004938215],"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.0001740238,0.0002536825,0.0007006492,0.0003261964,0.00006968345,0.0001086824,0.0001975132,0.6258556,0.001010996,0.3312829,0.008663485,0.03135661],"study_design_scores_gemma":[0.00004600886,0.00005692448,0.000175705,0.00005426506,0.00001462304,0.00005432332,0.0000603199,0.7590653,0.0002969186,0.2361466,0.00400894,0.00002014955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01783174,0.0008281389,0.953716,0.001330456,0.0001714753,0.0002060138,0.0006322458,0.0002526841,0.02503131],"genre_scores_gemma":[0.6130517,0.002113855,0.3608779,0.001134204,0.0005308649,0.001073284,0.001553081,0.0005441448,0.019121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01439367,"threshold_uncertainty_score":0.04815155,"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."}}