{"id":"W2521963297","doi":"","title":"Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem","year":2000,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Centrum Wiskunde and Informatica; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Research Consortium for Informatics and Mathematics; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Reservation; Competitive analysis; Upper and lower bounds; Matching (statistics); Combinatorics; Line (geometry); Asymptotically optimal algorithm; Computer science; Mathematics; Discrete mathematics; Mathematical optimization; Computer network; Statistics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0107115,0.003731149,0.003998603,0.003025566,0.003549772,0.006645465,0.00622633,0.004274369,0.01685876],"category_scores_gemma":[0.05908626,0.001219138,0.002067475,0.004360577,0.004534272,0.01066108,0.00501417,0.005885085,0.003212093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006534741,"about_ca_system_score_gemma":0.006728529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004959978,"about_ca_topic_score_gemma":0.004979644,"domain_scores_codex":[0.9875947,0.003754576,0.0004044384,0.00172263,0.003030618,0.003492979],"domain_scores_gemma":[0.9384238,0.04989833,0.002672154,0.00470372,0.001754232,0.002547783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.005631013,0.001999344,0.003732865,0.0008714192,0.000294771,0.0003076252,0.0007024714,0.4543991,0.01194092,0.3691173,0.02061848,0.1303847],"study_design_scores_gemma":[0.0002741143,0.0004897898,0.00063478,0.0001030352,0.00009589468,0.000290723,0.0001572582,0.7733927,0.00422279,0.215755,0.004525012,0.00005885445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3016188,0.003909056,0.568904,0.007144023,0.0005325068,0.001032746,0.001479813,0.002747675,0.1126314],"genre_scores_gemma":[0.8363371,0.003183835,0.1402714,0.00165114,0.00079813,0.0009961575,0.001508861,0.001087735,0.01416571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01685876,"threshold_uncertainty_score":0.05664855,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1140742094178715,"score_gpt":0.3627707798904767,"score_spread":0.2486965704726053,"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."}}