{"id":"W4403364360","doi":"10.1016/j.ejor.2024.10.014","title":"Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mediation; Inverse; Mathematical optimization; Conflict resolution; Graph; Path (computing); Theoretical computer science; Operations research; Mathematics; Political science; Computer network","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.001456668,0.0008606255,0.001242178,0.001106828,0.0009337696,0.002091987,0.002271141,0.002407409,0.01501405],"category_scores_gemma":[0.007625832,0.0007150501,0.001307795,0.0009777471,0.001559487,0.00373074,0.002145446,0.002766902,0.000695245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252161,"about_ca_system_score_gemma":0.003410642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008384163,"about_ca_topic_score_gemma":0.006792335,"domain_scores_codex":[0.9990402,0.0004960531,0.00002169044,0.000173567,0.00012065,0.0001478151],"domain_scores_gemma":[0.9966761,0.002638932,0.000188157,0.0001274124,0.0001825787,0.0001867314],"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.0001546854,0.0001587478,0.0005518794,0.0002032023,0.00007282818,0.0001986948,0.000236794,0.6850227,0.0009219999,0.2958336,0.001575962,0.01506899],"study_design_scores_gemma":[0.00002938548,0.00005396365,0.00009505617,0.00002380018,0.00002790841,0.00003143664,0.0001242436,0.8139929,0.0002061941,0.1846285,0.0007739592,0.00001280866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1042793,0.0003068568,0.863438,0.001414025,0.00006281829,0.0001667399,0.0002515875,0.0001781584,0.02990253],"genre_scores_gemma":[0.803813,0.000406561,0.1863583,0.0001855897,0.00002782187,0.0002450538,0.0003002116,0.0001243396,0.008539217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01501405,"threshold_uncertainty_score":0.05022699,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.6142092893936134,"score_gpt":0.4791714146721988,"score_spread":0.1350378747214146,"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."}}