{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075746,0.001588683,0.003384467,0.001174156,0.001982369,0.005073335,0.005013183,0.003948445,0.01319949],"category_scores_gemma":[0.02045665,0.0007922247,0.001398969,0.002567549,0.003129867,0.00809854,0.004315524,0.005583663,0.00170102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002209925,"about_ca_system_score_gemma":0.002112477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002567974,"about_ca_topic_score_gemma":0.002424386,"domain_scores_codex":[0.9974306,0.001169655,0.0001122622,0.0003591643,0.000567897,0.0003604616],"domain_scores_gemma":[0.9857805,0.01110614,0.0004638593,0.001137801,0.0006883382,0.0008234347],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005392749,0.0003185408,0.0004620724,0.0003088095,0.00009406596,0.0001228595,0.0002121609,0.1504463,0.001006565,0.7751483,0.01297391,0.05836724],"study_design_scores_gemma":[0.00009984788,0.00004639874,0.00007360095,0.00002296742,0.00002054661,0.00005424298,0.00003517943,0.4708768,0.0002277019,0.5263261,0.002198839,0.00001780185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06146466,0.003105927,0.8858041,0.002696049,0.000418002,0.0001803879,0.0002780211,0.0008002197,0.04525268],"genre_scores_gemma":[0.7475058,0.00175692,0.2207056,0.0006767777,0.0004575961,0.0004568326,0.0004819588,0.0004263021,0.02753223],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01319949,"threshold_uncertainty_score":0.04415667,"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."}}