{"id":"W2569788251","doi":"10.1287/moor.2014.0699","title":"The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Simplex; Bounded function; Markov decision process; Combinatorics; Discounting; Polynomial; Simplex algorithm; Mathematical optimization; Markov chain; Discrete mathematics; Binary logarithm; Time complexity; Markov process; Applied mathematics; Linear programming; Statistics","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":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007239034,0.0000983966,0.0001640602,0.0001669793,0.0005691579,0.0005032583,0.001545285,0.00006072166,0.000006143173],"category_scores_gemma":[0.0120187,0.00006790041,0.00004380557,0.0006698255,0.0001532197,0.0004130589,0.0003486615,0.0001486562,0.00002190564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007477463,"about_ca_system_score_gemma":0.000763313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001553211,"about_ca_topic_score_gemma":0.00003230782,"domain_scores_codex":[0.9978652,0.0002445372,0.0004846682,0.0002497158,0.000832922,0.0003229695],"domain_scores_gemma":[0.9937404,0.003072634,0.0000650052,0.0009372036,0.002076601,0.0001082044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001497949,0.0006411665,0.00001682891,0.0006707664,0.00007129089,0.000001831586,0.01779083,0.005544464,0.002828113,0.5549508,0.02814853,0.3891856],"study_design_scores_gemma":[0.000284503,0.000261425,0.0000133475,0.00003423884,0.000005172541,0.00000845213,0.0007118722,0.9552886,0.01396292,0.02272572,0.006612369,0.00009133149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005020255,0.00007648736,0.9924088,0.0005884788,0.0001146562,0.0008112429,0.00001639203,0.00002615854,0.0009375382],"genre_scores_gemma":[0.03839941,0.00001350402,0.9606198,0.00001256259,0.00005235116,0.0002729661,0.000002430199,0.00001285196,0.0006140993],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9497442,"threshold_uncertainty_score":0.9963035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2552575597432615,"score_gpt":0.5082352828044298,"score_spread":0.2529777230611683,"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."}}