{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004590317,0.0001692872,0.0002831025,0.0002520254,0.00005639229,0.000173134,0.0003418928,0.00007942542,0.00001491722],"category_scores_gemma":[0.00003334513,0.0001399415,0.00006940699,0.001376086,0.000008374767,0.000472089,0.00001433941,0.0001120825,0.00003703768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003941693,"about_ca_system_score_gemma":0.0001234482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002709528,"about_ca_topic_score_gemma":0.00002723538,"domain_scores_codex":[0.9980901,0.0000870465,0.0006748306,0.000303999,0.0006442906,0.0001997368],"domain_scores_gemma":[0.9984277,0.00004773348,0.0005646932,0.0002150054,0.0006091765,0.0001356768],"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.0001022515,0.0002111328,0.005581178,0.00001527332,0.00002848169,0.000003967506,0.0002609222,0.9901222,0.00003795554,0.003350539,0.00003898886,0.0002471159],"study_design_scores_gemma":[0.001386043,0.0002505406,0.007372129,0.000142466,0.00002154399,0.00001441921,0.00005947117,0.9905083,0.00001163431,0.00001210921,0.00005802335,0.0001633282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02846972,0.00001849362,0.9698433,0.0006395391,0.0002268941,0.0006503021,0.00001216099,0.00002464189,0.0001149552],"genre_scores_gemma":[0.7637476,0.000005630925,0.235954,0.0001890571,0.00002336938,0.00001814077,0.00002663101,0.000008797218,0.00002671589],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7352779,"threshold_uncertainty_score":0.5706649,"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."}}