{"id":"W2806450235","doi":"10.1007/s10898-019-00750-9","title":"On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto; Thales (Canada)","funders":"","keywords":"Minimum-cost flow problem; Flow network; Extension (predicate logic); Pareto principle; Flow (mathematics); Pareto optimal; Function (biology); Nash equilibrium","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.005641526,0.002289955,0.002766742,0.00285971,0.001370652,0.002474083,0.001771395,0.003464423,0.003449512],"category_scores_gemma":[0.01686873,0.001304984,0.001768674,0.002116165,0.002613779,0.00224682,0.003568348,0.002344189,0.0003136541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001205198,"about_ca_system_score_gemma":0.0018763,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004912156,"about_ca_topic_score_gemma":0.00318896,"domain_scores_codex":[0.9989139,0.0006898449,0.0000405311,0.000092887,0.0001656117,0.00009721347],"domain_scores_gemma":[0.9929233,0.006032437,0.0002285513,0.00008349505,0.0005639594,0.0001682418],"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.00007856485,0.00009436471,0.000297082,0.0001780084,0.00005293476,0.00009171927,0.0001397556,0.9363601,0.0006487203,0.04798654,0.0008055774,0.01326674],"study_design_scores_gemma":[0.00001040112,0.0000323958,0.00004742789,0.000018987,0.000008252736,0.000008375602,0.00002555463,0.983723,0.0001198778,0.01574911,0.0002490173,0.00000757906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02532293,0.0008967372,0.9644661,0.0006100378,0.00007618502,0.000178637,0.00004277278,0.00005388464,0.008352729],"genre_scores_gemma":[0.5747766,0.002584893,0.4084165,0.0003209515,0.0001827233,0.00080993,0.0001862887,0.0002269488,0.01249524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005641526,"threshold_uncertainty_score":0.02983558,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008113083000218386,"score_gpt":0.2363039213860832,"score_spread":0.2281908383858648,"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."}}