{"id":"W646988672","doi":"10.1016/j.tcs.2015.05.034","title":"Competitive algorithms for unbounded one-way trading","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Hebei Province; Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Competitive analysis; Upper and lower bounds; Value (mathematics); Online algorithm; Product (mathematics); Combinatorics; Mathematics; Integer (computer science); Function (biology); Revenue; Logarithm; Sequence (biology); Algorithm; Discrete mathematics; Computer science; Economics; Statistics; Finance","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.002521096,0.0001646909,0.0002185348,0.0002037177,0.0004255663,0.0008444858,0.002284663,0.00004935837,0.00002174989],"category_scores_gemma":[0.0001979059,0.0001443417,0.00006534042,0.001122163,0.001975154,0.000949253,0.0006519161,0.0001573749,0.00005416313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001232233,"about_ca_system_score_gemma":0.0003165983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002126432,"about_ca_topic_score_gemma":5.31538e-7,"domain_scores_codex":[0.9973794,0.000114049,0.0002684953,0.0007072992,0.0008537528,0.0006770096],"domain_scores_gemma":[0.9978139,0.0003203475,0.00006080519,0.0005712073,0.000617686,0.0006160241],"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.000007054913,0.00006720281,0.000004522735,0.000004507168,0.000003807368,0.000002278404,0.0008884009,0.0003978533,0.00008351015,0.9830654,0.0001505869,0.01532488],"study_design_scores_gemma":[0.0004750701,0.0003060304,0.00002736724,0.00001649295,0.000002026668,0.0000143712,0.00001888552,0.7162617,0.001283784,0.2806847,0.00074326,0.0001662896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004173448,0.00001406765,0.9797343,0.002611533,0.0006714808,0.000395795,0.000002916511,0.0002599955,0.01589259],"genre_scores_gemma":[0.484391,0.000001355026,0.5148932,0.0005655481,0.0001013841,0.00001555317,0.000001408543,0.000006385036,0.00002413536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7158639,"threshold_uncertainty_score":0.8143396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06660840790346818,"score_gpt":0.3120744565692413,"score_spread":0.2454660486657731,"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."}}